Arto Salomaa

According to our database1, Arto Salomaa
  • authored at least 273 papers between 1960 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Minimal reaction systems: Duration and blips.
Theor. Comput. Sci., 2017

Preface.
Fundam. Inform., 2017

Ambiguity, Nondeterminism and State Complexity of Finite Automata.
Acta Cybern., 2017

Depth of Closed Classes of Truth Functions in Many-Valued Logic.
Proceedings of the Role of Theory in Computer Science, 2017

2015
Applications of the Chinese remainder theorem to reaction systems with duration.
Theor. Comput. Sci., 2015

Alberto Apostolico.
Int. J. Found. Comput. Sci., 2015

Two-Step Simulations of Reaction Systems by Minimal Ones.
Acta Cybern., 2015

2014
Compositions of Reaction Systems.
Journal of Automata, Languages and Combinatorics, 2014

Wilfried Brauer (1937-2014) in memoriam.
Bulletin of the EATCS, 2014

Minimal Reaction Systems Defining Subset Functions.
Proceedings of the Computing with New Resources, 2014

On Axiomatizations of General Many-Valued Propositional Calculi.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
Minimal and almost minimal reaction systems.
Natural Computing, 2013

Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012.
Int. J. Found. Comput. Sci., 2013

Functional Constructions between reaction Systems and Propositional Logic.
Int. J. Found. Comput. Sci., 2013

Undecidability of state complexity.
Int. J. Comput. Math., 2013

2012
Functions and sequences generated by reaction systems.
Theor. Comput. Sci., 2012

Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

Sheng Yu.
Int. J. Found. Comput. Sci., 2012

Sheng Yu (1950-2012) In Memoriam.
Fundam. Inform., 2012

Mirror Images and Schemes for the Maximal Complexity of Nondeterminism.
Fundam. Inform., 2012

In Memoriam Sheng Yu (1950-2012).
Bulletin of the EATCS, 2012

Undecidability of State Complexities Using Mirror Images.
Proceedings of the Languages Alive, 2012

On State Sequences Defined by Reaction Systems.
Proceedings of the Logic and Program Semantics, 2012

Composition Sequences and Synchronizing Automata.
Proceedings of the Computation, Physics and Beyond, 2012

2011
Power Sums Associated with Certain Recursive Procedures on Words.
Int. J. Found. Comput. Sci., 2011

Preface.
Fundam. Inform., 2011

Undecidability of the State Complexity of Composed Regular Operations.
Proceedings of the Language and Automata Theory and Applications, 2011

On Some Biologically Motivated Control Devices for Parallel Rewriting.
Proceedings of the Computation, 2011

2010
Criteria for the matrix equivalence of words.
Theor. Comput. Sci., 2010

Ordered Catenation Closures and Decompositions of Languages Related to a Language of Derick Wood.
J. UCS, 2010

Seventy Years Derick Wood.
J. UCS, 2010

Subword balance, position indices and power sums.
J. Comput. Syst. Sci., 2010

Subword Occurrences, Parikh Matrices and Lyndon Images.
Int. J. Found. Comput. Sci., 2010

2009
Variants of codes and indecomposable languages.
Inf. Comput., 2009

Characteristic Words for Parikh Matrices.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008
Subword histories and associated matrices.
Theor. Comput. Sci., 2008

State complexity of basic language operations combined with reversal.
Inf. Comput., 2008

Length Codes, Products of Languages and Primality.
Proceedings of the Language and Automata Theory and Applications, 2008

2007
State complexity of combined operations.
Theor. Comput. Sci., 2007

On the existence of prime decompositions.
Theor. Comput. Sci., 2007

Comparing Subword Occurrences in Binary D0L Sequences.
Int. J. Found. Comput. Sci., 2007

Spiking Neural P Systems: an Early Survey.
Int. J. Found. Comput. Sci., 2007

Subword Balance in BinaryWords, Languages and Sequences.
Fundam. Inform., 2007

State Complexity of Basic Operations Combined with Reversal.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

On Languages Defined by Numerical Parameters.
Proceedings of the Formal Models, 2007

2006
Independence of certain quantities indicating subword occurrences.
Theor. Comput. Sci., 2006

Subword conditions and subword histories.
Inf. Comput., 2006

On Some Problems of Mateescu Concerning Subword Occurrences.
Fundam. Inform., 2006

Secret Sharing Schemes with Nice Access Structures.
Fundam. Inform., 2006

2005
Connections between subwords and certain matrix mappings.
Theor. Comput. Sci., 2005

On the Injectivity of Parikh Matrix Mappings.
Fundam. Inform., 2005

2004
On the state complexity of reversals of regular languages.
Theor. Comput. Sci., 2004

Subword histories and Parikh matrices.
J. Comput. Syst. Sci., 2004

Matrix Indicators For Subword Occurrences And Ambiguity.
Int. J. Found. Comput. Sci., 2004

The Power of Networks of Watson-Crick D0L Systems.
Proceedings of the Aspects of Molecular Computing, 2004

2003
Watson-Crick D0L systems: the power of one transition.
Theor. Comput. Sci., 2003

Composition sequences for functions over a finite domain.
Theor. Comput. Sci., 2003

Power and size of extended Watson-Crick L systems.
Theor. Comput. Sci., 2003

Cartesian authentication codes from functions with optimal nonlinearity.
Theor. Comput. Sci., 2003

From Watson-Crick L systems to Darwinian P systems.
Natural Computing, 2003

Counting (scattered) Subwords.
Bulletin of the EATCS, 2003

Three Constructions of Authentication/Secrecy Codes.
Proceedings of the Applied Algebra, 2003

2002
Uni-transitional Watson-Crick D0L systems.
Theor. Comput. Sci., 2002

ICALP, EATCS and Maurice Nivat.
Theor. Comput. Sci., 2002

Operations and language generating devices suggested by the genome evolution.
Theor. Comput. Sci., 2002

Topics in the theory of DNA computing.
Theor. Comput. Sci., 2002

Generation of Constants and Synchronization of Finite Automata.
J. UCS, 2002

Some Decision Problems Concerning Semilinearity and Commutation.
J. Comput. Syst. Sci., 2002

Factorizations of Languages and Commutativity Conditions.
Acta Cybern., 2002

DNA Complementarity and Paradigms of Computing.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Synchronization of Finite Automata: Contributions to an Old Problem.
Proceedings of the Essence of Computation, Complexity, Analysis, 2002

Nondeterministic Trajectories.
Proceedings of the Formal and Natural Computing, 2002

2001
Language-theoretic aspects of DNA complematarity.
Theor. Comput. Sci., 2001

Watson-Crick D0L systems with regular triggers.
Theor. Comput. Sci., 2001

A sharpening of the Parikh mapping.
ITA, 2001

Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Iterated Morphisms with Complementarity on the DNA Alphabet.
Proceedings of the Words, Semigroups, and Transductions, 2001

Sewing contexts and mildly context-sensitive languages.
Proceedings of the Where Mathematics, 2001

Lindenmayer and DNA: Watson-Crick D0L Systems.
Current Trends in Theoretical Computer Science, 2001

Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring.
Current Trends in Theoretical Computer Science, 2001

Simple Words in Equality Sets.
Current Trends in Theoretical Computer Science, 2001

Networks of Language Processors: Parallel Communicating Systems.
Current Trends in Theoretical Computer Science, 2001

2000
On slender 0L languages.
Theor. Comput. Sci., 2000

A characterization of poly-slender context-free languages.
ITA, 2000

Membrane Computing with External Output.
Fundam. Inform., 2000

Depth of Functional Compositions.
Bulletin of the EATCS, 2000

On strongly context-free languages.
Discrete Applied Mathematics, 2000

On the Expressiveness of Subset-Sum Representations.
Acta Inf., 2000

Compositions over a Finite Domain: From Completeness to Synchronizable Automata.
Proceedings of the A Half-Century of Automata Theory: Celebration and Inspiration, 2000

Networks of Watson-Crick D0L Systems.
Proceedings of the International Colloquium on Words, 2000

1999
Theoretical Computer Science.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring.
Bulletin of the EATCS, 1999

Watson-Crick Walks and Roads on DOL Graphs.
Acta Cybern., 1999

DNA Computing: New Ideas and Paradigms.
Proceedings of the Automata, 1999

Caesar and DNA. Views on Cryptology.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

On the decomposition of finite languages.
Proceedings of the Developments in Language Theory, 1999

1998
Shuffle on Trajectories: Syntactic Constraints.
Theor. Comput. Sci., 1998

Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars.
Theor. Comput. Sci., 1998

On Well Quasi Orders of Free Monoids.
Theor. Comput. Sci., 1998

2-Testability and Relabelings Produce Everything.
J. Comput. Syst. Sci., 1998

Networks of Language Processors: Parallel Communicating Systems.
Bulletin of the EATCS, 1998

Simple Splicing Systems.
Discrete Applied Mathematics, 1998

Complementarity versus universality: Keynotes of DNA computing.
Complexity, 1998

DNA Computing, Sticker Systems, and Universality.
Acta Inf., 1998

Shuffle on Trajectories: The Schützenberger Product and Related Operations.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

DNA Computing - New Computing Paradigms.
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-03563-4, 1998

1997
Geometric Transformations on Language Families: The Power of Symmetry.
Int. J. Found. Comput. Sci., 1997

Pattern Languages Versus Parallel Communicating Grammar Systems.
Int. J. Found. Comput. Sci., 1997

Conjugate Words, Cuts of the Deck and Cryptographic Protocols.
Bulletin of the EATCS, 1997

Lindenmayer and DNA: Watson-Crick D0L Systems.
Bulletin of the EATCS, 1997

TWOPRIME: A Fast Stream Ciphering Algorithm.
Proceedings of the Fast Software Encryption, 4th International Workshop, 1997

Watson-Crick finite automata.
Proceedings of the DNA Based Computers, 1997

Syntactic and Semantic Aspects of Parallelism.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

Shuffle-like Operations on omega-words.
Proceedings of the New Trends in Formal Languages, 1997

Networks of Parallel Language Processors.
Proceedings of the New Trends in Formal Languages, 1997

1996
Computing by Splicing.
Theor. Comput. Sci., 1996

Slender 0L Languages.
Theor. Comput. Sci., 1996

Pattern Systems.
Theor. Comput. Sci., 1996

The Power of Restricted Splicing with Rules from a Regular Language.
J. UCS, 1996

Pattern Grammars.
Journal of Automata, Languages and Combinatorics, 1996

Contextual Grammars: Parallelism and Blocking of Derivation.
Fundam. Inform., 1996

Conjugate Words, Cuts of the Deck and Cryptographic Protocol.
Bulletin of the EATCS, 1996

Views on Linguistics.
Bulletin of the EATCS, 1996

Simple Words in Equality Sets.
Bulletin of the EATCS, 1996

On Cooperatively Distributed Ciphering and Hashing.
Computers and Artificial Intelligence, 1996

Growth Functions and Length Sets of Replicating Systems.
Acta Cybern., 1996

On Regular Characterizations of Languages by Grammar Systems.
Acta Cybern., 1996

On Representing RE Languages by One-Sided Internal Contextual Languages.
Acta Cybern., 1996

From DNA Recombination to DNA Computing, Via Formal Languages.
German Conference on Bioinformatics, 1996

From DNA Recombination to DNA Computing, Via Formal Languages.
Proceedings of the Bioinformatics, German Conference on Bioinformatics, Leipzig, 1996

Public Key Cryptography, Second Edition.
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-03269-5, 1996

1995
P, NP and the Post Correspondence Problem
Inf. Comput., September, 1995

Multi-Pattern Languages.
Theor. Comput. Sci., 1995

Grammars Based on the Shuffle Operation.
J. UCS, 1995

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.
J. UCS, 1995

Parikh Prime Words and GO-like Territories.
J. UCS, 1995

Conditional Tabled Eco-Grammar Systems.
J. UCS, 1995

Teams in cooperating grammar systems.
J. Exp. Theor. Artif. Intell., 1995

Decision Problems for Patterns.
J. Comput. Syst. Sci., 1995

On Parallel Deletions Applied to a Word.
ITA, 1995

Return to Patterns.
Bulletin of the EATCS, 1995

From Parikh vectors to GO territories.
Bulletin of the EATCS, 1995

Thin and Slender Languages.
Discrete Applied Mathematics, 1995

Generalised DOL Trees.
Acta Cybern., 1995

1994
Journal of Universal Computer Science.
J. UCS, 1994

Finite Degrees of Ambiguity in Pattern Languages.
ITA, 1994

Patterns.
Bulletin of the EATCS, 1994

Nondeterminism in Patterns.
Proceedings of the STACS 94, 1994

Cornerstones of undecidability.
Prentice Hall International Series in Computer Science, Prentice Hall, ISBN: 978-0-13-297425-7, 1994

1993
L codes and L Systems with immigration.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Decidability in Finite Automata.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

What Emil said about the Post Correspondence Problem.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Formal Language Theory.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

In the prehistory of formal language theory: Gauss languages.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Closure Properties of Slender Languages.
Theor. Comput. Sci., 1993

Language-theoretic problems arising from Richelieu cryptosystems.
Theor. Comput. Sci., 1993

PCP-Prime Words and Primality Types.
ITA, 1993

On the Union of 0L Languages.
Inf. Process. Lett., 1993

Grammars Based on Patterns.
Int. J. Found. Comput. Sci., 1993

Deletion Sets.
Fundam. Inform., 1993

Simple Reductions Between D0L Language and Sequence Equivalence Problems.
Discrete Applied Mathematics, 1993

Gramars with Oracles.
Sci. Ann. Cuza Univ., 1993

On Simplest Possible Solutions for Post Correspondence Problems.
Acta Inf., 1993

Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Inclusion is Undecidable for Pattern Languages.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Pattern Languages: Problems of Decidability and Generation.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Contextual Grammars: Erasing, Determinism, One-Side Contexts.
Proceedings of the Developments in Language Theory, 1993

Algorithmically Coding the Universe.
Proceedings of the Developments in Language Theory, 1993

1992
Characterization results about L codes.
ITA, 1992

What Emil said about the Post correspondance problem.
Bulletin of the EATCS, 1992

Decision Problems Concerning the Thinness of DOL Languages.
Bulletin of the EATCS, 1992

In the prehistory of formal language theory: Gauss Languages.
Bulletin of the EATCS, 1992

Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure.
Acta Cybern., 1992

1991
A Deterministic Algorithm for Modular Knapsack Problems.
Theor. Comput. Sci., 1991

Bounded Delay L Codes.
Theor. Comput. Sci., 1991

Many aspects of formal languages.
Inf. Sci., 1991

Primary Types of Instances of the Post Correspondence Problem.
Bulletin of the EATCS, 1991

L Codes and L Systems with Immigration.
Bulletin of the EATCS, 1991

Preface.
Discrete Applied Mathematics, 1991

Secret ballot elections in computer networks.
Computers & Security, 1991

L Morphisms: Bounded Delay and Regularity of Ambiguity.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Verifying and Recasting Secret Ballots in Computer Networks.
Proceedings of the New Results and New Trends in Computer Science, 1991

1990
Public-Key Cryptography
EATCS Monographs on Theoretical Computer Science 23, Springer, ISBN: 0-387-52831-8, 1990

Secret Selling of Secrets with Several Buyers.
Bulletin of the EATCS, 1990

Decidability in finite automata.
Bulletin of the EATCS, 1990

Decision problems arising from knapsack transformations.
Acta Cybern., 1990

Formal Language and Power Series.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990

1989
Public-Key Cryptosystems and Language Theory.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

The Formal Language Theory Column.
Bulletin of the EATCS, 1989

1988
A Pumping Result for 2-Context-Free Languages.
Theor. Comput. Sci., 1988

The Formal Language Theory Column.
Bulletin of the EATCS, 1988

The formal language theory column.
Bulletin of the EATCS, 1988

The Formal Language Theory Column.
Bulletin of the EATCS, 1988

A public-key cryptosystem based on language theory.
Computers & Security, 1988

Cryptography and Data Security.
Proceedings of the Machines, 1988

1987
Formal Language Theory Column - Two-way Thue.
Bulletin of the EATCS, 1987

The formal Language Theory Column.
Bulletin of the EATCS, 1987

Formal languages.
Computer science classics, Academic Press, ISBN: 978-0-12-615750-5, 1987

1986
Systolic Trellis Automata: Stability, Decidability and Complexity
Information and Control, December, 1986

On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions.
Theor. Comput. Sci., 1986

On the equivalence of grammars inferred from derivation.
Bulletin of the EATCS, 1986

Semirings, Automata, Languages
EATCS Monographs on Theoretical Computer Science 5, Springer, ISBN: 978-3-642-69959-7, 1986

The book of L.
Springer, ISBN: 978-3-540-16022-9, 1986

1985
Syntactic monoids in the construction of systolic tree automata.
International Journal of Parallel Programming, 1985

The Ehrenfeucht conjecture: a proof for language theorists.
Bulletin of the EATCS, 1985

1984
Systolic Tree Acceptors.
ITA, 1984

1983
Ambiguity and Decision Problems Concerning Number Systems
Information and Control, March, 1983

A Supernormal-Form Theorem for Context-Free Grammars
J. ACM, January, 1983

L Codes and Number Systems.
Theor. Comput. Sci., 1983

On a Family of L Languages Resulting from Systolic Tree Automata.
Theor. Comput. Sci., 1983

Ambiguity and Decision Problems Concerning Number Systems.
Proceedings of the Automata, 1983

1982
On Infinite Words Obtained by Iterating Morphisms.
Theor. Comput. Sci., 1982

Finitary and Infinitary Interpretations of Languages.
Mathematical Systems Theory, 1982

Dense Hierarchies of Grammatical Families.
J. ACM, 1982

A homomorphic characterization of regular languages.
Discrete Applied Mathematics, 1982

Systolic Automata for VLSI on Balanced Trees.
Acta Inf., 1982

1981
On Predecessors of Finite Languages
Information and Control, September, 1981

Uniform Interpretations of Grammar Forms.
SIAM J. Comput., 1981

Completeness of Context-Free Grammar Forms.
J. Comput. Syst. Sci., 1981

Synchronized EOL Forms Under Uniform Interpretation.
ITA, 1981

Sub-Regular Grammar Forms.
Inf. Process. Lett., 1981

Table systems with unconditional transfer.
Discrete Applied Mathematics, 1981

Decidability and density in two-symbol grammar forms.
Discrete Applied Mathematics, 1981

Colorings and interpretations: a connection between graphs and grammar forms.
Discrete Applied Mathematics, 1981

1980
MSW Spaces
Information and Control, September, 1980

Pure Grammars
Information and Control, January, 1980

Synchronized E0L Forms.
Theor. Comput. Sci., 1980

Context-Free Grammar Forms with Strict Interpretations.
J. Comput. Syst. Sci., 1980

Test Sets and Checking Words for Homomorphism Equivalence.
J. Comput. Syst. Sci., 1980

On Generators and Generative Capacity of EOL Forms.
Acta Inf., 1980

Grammatical Families.
Proceedings of the Automata, 1980

1979
Context-Dependent L Forms
Information and Control, July, 1979

On Non Context-Free Grammar Forms.
Mathematical Systems Theory, 1979

Pure interpretations for EOL forms.
ITA, 1979

Power from Power Series.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978
Uniform Interpretations of L Forms
Information and Control, February, 1978

Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms.
Theor. Comput. Sci., 1978

On Good E0L Forms.
SIAM J. Comput., 1978

ETOL Forms.
J. Comput. Syst. Sci., 1978

On the Decidability of Homomorphism Equivalence for Languages.
J. Comput. Syst. Sci., 1978

Relative Goodness for EOL Forms.
ITA, 1978

Equality sets for homomorphisms of free monoids.
Acta Cybern., 1978

Formale Sprachen.
Springer, ISBN: 978-3-540-09030-4, 1978

Automata-Theoretic Aspects of Formal Power Series.
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4612-6264-0, 1978

1977
Bibliography of L Systems.
Theor. Comput. Sci., 1977

On the Form Equivalence of L-Forms.
Theor. Comput. Sci., 1977

New squeezing mechanisms for L systems.
Inf. Sci., 1977

EOL Forms.
Acta Inf., 1977

1976
Context-Free Grammars with Graph-Controlled Tables.
J. Comput. Syst. Sci., 1976

Undecidable Problems Concerning Growth in Informationless Lindenmayer Systems.
Elektronische Informationsverarbeitung und Kybernetik, 1976

Recent Results on L Systems.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975
Formal Power Series and Growth Functions of Lindenmayer Systems.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

1974
Solution of a decision problem concerning unary Lindenmayer systems.
Discrete Mathematics, 1974

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems.
Acta Inf., 1974

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems.
Acta Inf., 1974

Parallelism in Rewriting Systems.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29, 1974

Iteration Grammars and Lindenmayer AFL's.
Proceedings of the L Systems, 1974

1973
Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems
Information and Control, November, 1973

On Sentential Forms of Context-Free Grammars.
Acta Inf., 1973

L-Systems: A Device in Biologically Motivated Automata Theory.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

On some recent problems concerning developmental languages.
Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

1972
Matrix Grammars with a Leftmost Restriction
Information and Control, March, 1972

1971
The Generative Capacity of Transformational Grammars of Ginsburg and Partee
Information and Control, April, 1971

1970
Periodically Time-Variant Context-Free Grammars
Information and Control, October, 1970

1969
Probabilistic and Weighted Grammars
Information and Control, December, 1969

On the Index of a Context-Free Grammar and Language
Information and Control, May, 1969

1968
On Finite Automata with a Time-Variant Structure
Information and Control, August, 1968

On Regular Expressions and Regular Canonical Systems.
Mathematical Systems Theory, 1968

1967
On m-adic Probabilistic Automata
Information and Control, February, 1967

1966
Two Complete Axiom Systems for the Algebra of Regular Events.
J. ACM, 1966

1960
A Theorem Concerning the Composition of Functions of Several Variables Ranging Over a Finite Set.
J. Symb. Log., 1960


  Loading...