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

Two Complete Axiom Systems for the Algebra of Regular Events. - Arto Salomaa (J. ACM, 1966)

On m-adic Probabilistic Automata - Arto Salomaa (Inf. Control., 1967)

On Regular Expressions and Regular Canonical Systems. - Arto Salomaa (Math. Syst. Theory, 1968)

On Finite Automata with a Time-Variant Structure - Arto Salomaa (Inf. Control., 1968)

On the Index of a Context-Free Grammar and Language - Arto Salomaa (Inf. Control., 1969)

Probabilistic and Weighted Grammars - Arto Salomaa (Inf. Control., 1969)

Periodically Time-Variant Context-Free Grammars - Arto Salomaa (Inf. Control., 1970)

The Generative Capacity of Transformational Grammars of Ginsburg and Partee - Arto Salomaa (Inf. Control., 1971)

Matrix Grammars with a Leftmost Restriction - Arto Salomaa (Inf. Control., 1972)

On some recent problems concerning developmental languages. - Arto Salomaa (Automatentheorie und Formale Sprachen, 1973)

L-Systems: A Device in Biologically Motivated Automata Theory. - Arto Salomaa (MFCS, 1973)

On Sentential Forms of Context-Free Grammars. - Arto Salomaa (Acta Informatica, 1973)

Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems - Azaria Paz; Arto Salomaa (Inf. Control., 1973)

Iteration Grammars and Lindenmayer AFL's. - Arto Salomaa (L Systems, 1974)

Parallelism in Rewriting Systems. - Arto Salomaa (ICALP, 1974)

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems. - Mogens Nielsen; Grzegorz Rozenberg; Arto Salomaa; Sven Skyum (Acta Informatica, 1974)

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems. - Mogens Nielsen; Grzegorz Rozenberg; Arto Salomaa; Sven Skyum (Acta Informatica, 1974)

Solution of a decision problem concerning unary Lindenmayer systems. - Arto Salomaa (Discret. Math., 1974)

Growth Functions of Lindenmayer Systems: Some New Approaches. - Arto Salomaa (Automata, Languages, Development, 1975)

Formal Power Series and Growth Functions of Lindenmayer Systems. - Arto Salomaa (MFCS, 1975)

Recent Results on L Systems. - Arto Salomaa (MFCS, 1976)

Undecidable Problems Concerning Growth in Informationless Lindenmayer Systems. - Arto Salomaa (J. Inf. Process. Cybern., 1976)

Context-Free Grammars with Graph-Controlled Tables. - Grzegorz Rozenberg; Arto Salomaa (J. Comput. Syst. Sci., 1976)

EOL Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Acta Informatica, 1977)

New squeezing mechanisms for L systems. - Grzegorz Rozenberg; Arto Salomaa (Inf. Sci., 1977)

On the Form Equivalence of L-Forms. - Hermann A. Maurer; Thomas Ottmann; Arto Salomaa (Theor. Comput. Sci., 1977)

Bibliography of L Systems. - Grzegorz Rozenberg; Martti Penttonen; Arto Salomaa (Theor. Comput. Sci., 1977)

Automata-Theoretic Aspects of Formal Power Series. - Arto Salomaa; Matti Soittola (Springer, 1978)

Formale Sprachen. - Arto Salomaa (Springer, 1978)

Equality sets for homomorphisms of free monoids. - Arto Salomaa (Acta Cybern., 1978)

Relative Goodness for EOL Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (RAIRO Theor. Informatics Appl., 1978)

On the Decidability of Homomorphism Equivalence for Languages. - Karel Culík II; Arto Salomaa (J. Comput. Syst. Sci., 1978)

ETOL Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (J. Comput. Syst. Sci., 1978)

On Good E0L Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (SIAM J. Comput., 1978)

Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms. - Karel Culík II; Hermann A. Maurer; Thomas Ottmann; Keijo Ruohonen; Arto Salomaa (Theor. Comput. Sci., 1978)

Uniform Interpretations of L Forms - Hermann A. Maurer; Arto Salomaa; Derick Wood (Inf. Control., 1978)

Power from Power Series. - Arto Salomaa (MFCS, 1979)

Pure interpretations for EOL forms. - Hermann A. Maurer; Grzegorz Rozenberg; Arto Salomaa; Derick Wood (RAIRO Theor. Informatics Appl., 1979)

On Non Context-Free Grammar Forms. - Hermann A. Maurer; Martti Penttonen; Arto Salomaa; Derick Wood (Math. Syst. Theory, 1979)

Context-Dependent L Forms - Hermann A. Maurer; Arto Salomaa; Derick Wood (Inf. Control., 1979)

Grammatical Families. - Arto Salomaa (ICALP, 1980)

On Generators and Generative Capacity of EOL Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Acta Informatica, 1980)

Test Sets and Checking Words for Homomorphism Equivalence. - Karel Culík II; Arto Salomaa (J. Comput. Syst. Sci., 1980)

Context-Free Grammar Forms with Strict Interpretations. - Hermann A. Maurer; Arto Salomaa; Derick Wood (J. Comput. Syst. Sci., 1980)

Synchronized E0L Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Theor. Comput. Sci., 1980)

Pure Grammars - Hermann A. Maurer; Arto Salomaa; Derick Wood (Inf. Control., 1980)

MSW Spaces - Hermann A. Maurer; Arto Salomaa; Derick Wood (Inf. Control., 1980)

Colorings and interpretations: a connection between graphs and grammar forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Discret. Appl. Math., 1981)

Decidability and density in two-symbol grammar forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Discret. Appl. Math., 1981)

Table systems with unconditional transfer. - Grzegorz Rozenberg; Arto Salomaa (Discret. Appl. Math., 1981)

Sub-Regular Grammar Forms. - Thomas Ottmann; Arto Salomaa; Derick Wood (Inf. Process. Lett., 1981)

Synchronized EOL Forms Under Uniform Interpretation. - Hermann A. Maurer; Arto Salomaa; Derick Wood (RAIRO Theor. Informatics Appl., 1981)

Completeness of Context-Free Grammar Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (J. Comput. Syst. Sci., 1981)

Uniform Interpretations of Grammar Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (SIAM J. Comput., 1981)

On Predecessors of Finite Languages - Hermann A. Maurer; Arto Salomaa; Derick Wood (Inf. Control., 1981)

Systolic Automata for VLSI on Balanced Trees. - Karel Culík II; Jozef Gruska; Arto Salomaa (Acta Informatica, 1982)

A homomorphic characterization of regular languages. - Karel Culík II; Faith E. Fich; Arto Salomaa (Discret. Appl. Math., 1982)

Dense Hierarchies of Grammatical Families. - Hermann A. Maurer; Arto Salomaa; Derick Wood (J. ACM, 1982)

Finitary and Infinitary Interpretations of Languages. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Math. Syst. Theory, 1982)

On Infinite Words Obtained by Iterating Morphisms. - Karel Culík II; Arto Salomaa (Theor. Comput. Sci., 1982)

On a Family of L Languages Resulting from Systolic Tree Automata. - Karel Culík II; Jozef Gruska; Arto Salomaa (Theor. Comput. Sci., 1983)

L Codes and Number Systems. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Theor. Comput. Sci., 1983)

A Supernormal-Form Theorem for Context-Free Grammars - Hermann A. Maurer; Arto Salomaa; Derick Wood (J. ACM, 1983)

Ambiguity and Decision Problems Concerning Number Systems - Karel Culík II; Arto Salomaa (Inf. Control., 1983)

Systolic Tree Acceptors. - Karel Culík II; Arto Salomaa; Derick Wood (RAIRO Theor. Informatics Appl., 1984)

The Ehrenfeucht conjecture: a proof for language theorists. - Arto Salomaa (Bull. EATCS, 1985)

Syntactic monoids in the construction of systolic tree automata. - Helmut Jürgensen; Arto Salomaa (Int. J. Parallel Program., 1985)

The book of L. - Grzegorz Rozenberg; Arto Salomaa (Springer, 1986)

Semirings, Automata, Languages - Werner Kuich; Arto Salomaa (Springer, 1986)

On the equivalence of grammars inferred from derivation. - Efim B. Kinber; Arto Salomaa; Sheng Yu 001 (Bull. EATCS, 1986)

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

Systolic Trellis Automata: Stability, Decidability and Complexity - Karel Culík II; Jozef Gruska; Arto Salomaa (Inf. Control., 1986)

Formal languages. - Arto Salomaa (Academic Press, 1987)

Formal Language Theory Column - Two-way Thue. - Arto Salomaa (Bull. EATCS, 1987)

Cryptography and Data Security. - Arto Salomaa (IMYCS, 1988)

A public-key cryptosystem based on language theory. - Arto Salomaa (Comput. Secur., 1988)

The formal language theory column. - Arto Salomaa (Bull. EATCS, 1988)

The Formal Language Theory Column. - Arto Salomaa; Juhani Karhumäki (Bull. EATCS, 1988)

A Pumping Result for 2-Context-Free Languages. - Arto Salomaa (Theor. Comput. Sci., 1988)

Public-Key Cryptosystems and Language Theory. - Arto Salomaa (A Perspective in Theoretical Computer Science, 1989)

Formal Languages and Power Series. - Arto Salomaa (Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990)

Decision problems arising from knapsack transformations. - Arto Salomaa (Acta Cybern., 1990)

Decidability in finite automata. - Arto Salomaa (Bull. EATCS, 1990)

Secret Selling of Secrets with Several Buyers. - Arto Salomaa; Lila Santean (Bull. EATCS, 1990)

Public-Key Cryptography - Arto Salomaa (Springer, 1990)

Verifying and Recasting Secret Ballots in Computer Networks. - Arto Salomaa (New Results and New Trends in Computer Science, 1991)

L Morphisms: Bounded Delay and Regularity of Ambiguity. - Juha Honkala; Arto Salomaa (ICALP, 1991)

Secret ballot elections in computer networks. - Hannu Nurmi; Arto Salomaa; Lila Santean (Comput. Secur., 1991)

Preface. - Arto Salomaa (Discret. Appl. Math., 1991)

L Codes and L Systems with Immigration. - Arto Salomaa (Bull. EATCS, 1991)

Primary Types of Instances of the Post Correspondence Problem. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Bull. EATCS, 1991)

Many aspects of formal languages. - Arto Salomaa (Inf. Sci., 1991)

Bounded Delay L Codes. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Theor. Comput. Sci., 1991)

A Deterministic Algorithm for Modular Knapsack Problems. - Arto Salomaa (Theor. Comput. Sci., 1991)

Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure. - Jürgen Dassow; Alexandru Mateescu; Gheorghe Paun; Arto Salomaa (Acta Cybern., 1992)

In the prehistory of formal language theory: Gauss Languages. - Lila Kari; Solomon Marcus; Gheorghe Paun; Arto Salomaa (Bull. EATCS, 1992)

Decision Problems Concerning the Thinness of DOL Languages. - Gheorghe Paun; Arto Salomaa (Bull. EATCS, 1992)

What Emil said about the Post correspondance problem. - Arto Salomaa (Bull. EATCS, 1992)

Characterization results about L codes. - Juha Honkala; Arto Salomaa (RAIRO Theor. Informatics Appl., 1992)

Algorithmically Coding the Universe. - Cristian Calude; Arto Salomaa (Developments in Language Theory, 1993)

Contextual Grammars: Erasing, Determinism, One-Side Contexts. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Developments in Language Theory, 1993)

Pattern Languages: Problems of Decidability and Generation. - Arto Salomaa (FCT, 1993)

Inclusion is Undecidable for Pattern Languages. - Tao Jiang 001; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (ICALP, 1993)

Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes. - Alexandru Mateescu; Arto Salomaa (MFCS, 1993)

On Simplest Possible Solutions for Post Correspondence Problems. - Alexandru Mateescu; Arto Salomaa (Acta Informatica, 1993)

Gramars with Oracles. - Lila Kari; Alexandru Mateescu; Arto Salomaa; Gheorghe Paun (Sci. Ann. Cuza Univ., 1993)

Simple Reductions Between D0L Language and Sequence Equivalence Problems. - Arto Salomaa (Discret. Appl. Math., 1993)

Deletion Sets. - Lila Kari; Alexandru Mateescu; Arto Salomaa; Gheorghe Paun (Fundam. Informaticae, 1993)

Grammars Based on Patterns. - Jürgen Dassow; Gheorghe Paun; Arto Salomaa (Int. J. Found. Comput. Sci., 1993)

On the Union of 0L Languages. - Jürgen Dassow; Gheorghe Paun; Arto Salomaa (Inf. Process. Lett., 1993)

PCP-Prime Words and Primality Types. - Alexandru Mateescu; Arto Salomaa (RAIRO Theor. Informatics Appl., 1993)

Language-theoretic problems arising from Richelieu cryptosystems. - Mircea Andrasiu; Gheorghe Paun; Jürgen Dassow; Arto Salomaa (Theor. Comput. Sci., 1993)

Closure Properties of Slender Languages. - Gheorghe Paun; Arto Salomaa (Theor. Comput. Sci., 1993)

In the prehistory of formal language theory: Gauss languages. - Lila Kari; Solomon Marcus; Gheorghe Paun; Arto Salomaa (Current Trends in Theoretical Computer Science, 1993)

Formal Language Theory. - Arto Salomaa (Current Trends in Theoretical Computer Science, 1993)

What Emil said about the Post Correspondence Problem. - Arto Salomaa (Current Trends in Theoretical Computer Science, 1993)

Decidability in Finite Automata. - Arto Salomaa (Current Trends in Theoretical Computer Science, 1993)

L codes and L Systems with immigration. - Arto Salomaa (Current Trends in Theoretical Computer Science, 1993)

Cornerstones of undecidability. - Grzegorz Rozenberg; Arto Salomaa (Prentice Hall, 1994)

Marcus Contextual Grammars: Modularity and Leftmost Derivation. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Mathematical Aspects of Natural and Formal Languages, 1994)

Nondeterminism in Patterns. - Alexandru Mateescu; Arto Salomaa (STACS, 1994)

Conducting secret ballot elections in computer networks: Problems and solutions. - Hannu Nurmi; Arto Salomaa (Ann. Oper. Res., 1994)

Patterns. - Arto Salomaa (Bull. EATCS, 1994)

Finite Degrees of Ambiguity in Pattern Languages. - Alexandru Mateescu; Arto Salomaa (RAIRO Theor. Informatics Appl., 1994)

Journal of Universal Computer Science. - Cristian Calude; Hermann A. Maurer; Arto Salomaa (J. Univers. Comput. Sci., 1994)

Generalised DOL Trees. - Lila Kari; Grzegorz Rozenberg; Arto Salomaa (Acta Cybern., 1995)

Thin and Slender Languages. - Gheorghe Paun; Arto Salomaa (Discret. Appl. Math., 1995)

From Parikh vectors to GO territories. - Arto Salomaa (Bull. EATCS, 1995)

Return to Patterns. - Arto Salomaa (Bull. EATCS, 1995)

On Parallel Deletions Applied to a Word. - Lila Kari; Alexandru Mateescu; Gheorghe Paun; Arto Salomaa (RAIRO Theor. Informatics Appl., 1995)

Decision Problems for Patterns. - Tao Jiang 001; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (J. Comput. Syst. Sci., 1995)

Teams in cooperating grammar systems. - Lila Kari; Alexandru Mateescu; Gheorghe Paun; Arto Salomaa (J. Exp. Theor. Artif. Intell., 1995)

Conditional Tabled Eco-Grammar Systems. - Erzsébet Csuhaj-Varjú; Gheorghe Paun; Arto Salomaa (J. Univers. Comput. Sci., 1995)

Parikh Prime Words and GO-like Territories. - Alexandru Mateescu; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (J. Univers. Comput. Sci., 1995)

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. - Alexandru Mateescu; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (J. Univers. Comput. Sci., 1995)

Grammars Based on the Shuffle Operation. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (J. Univers. Comput. Sci., 1995)

Multi-Pattern Languages. - Lila Kari; Alexandru Mateescu; Gheorghe Paun; Arto Salomaa (Theor. Comput. Sci., 1995)

P, NP and the Post Correspondence Problem - Alexandru Mateescu; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Inf. Comput., 1995)

Public Key Cryptography, Second Edition. - Arto Salomaa (Springer, 1996)

From DNA Recombination to DNA Computing, Via Formal Languages. - Gheorghe Paun; Arto Salomaa (German Conference on Bioinformatics - Selected Papers, 1996)

On Representing RE Languages by One-Sided Internal Contextual Languages. - Andrzej Ehrenfeucht; Alexandru Mateescu; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Acta Cybern., 1996)

On Regular Characterizations of Languages by Grammar Systems. - Lucian Ilie; Arto Salomaa (Acta Cybern., 1996)

Growth Functions and Length Sets of Replicating Systems. - Valeria Mihalache; Arto Salomaa (Acta Cybern., 1996)

On Cooperatively Distributed Ciphering and Hashing. - Cunsheng Ding; Arto Salomaa (Comput. Artif. Intell., 1996)

Simple Words in Equality Sets. - Marjo Lipponen; Arto Salomaa (Bull. EATCS, 1996)

Views on Linguistics. - Alexandru Mateescu; Arto Salomaa (Bull. EATCS, 1996)

Conjugate Words, Cuts of the Deck and Cryptographic Protocol. - Arto Salomaa (Bull. EATCS, 1996)

Contextual Grammars: Parallelism and Blocking of Derivation. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Fundam. Informaticae, 1996)

Restricted use of the splicing operation. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Int. J. Comput. Math., 1996)

Pattern Grammars. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (J. Autom. Lang. Comb., 1996)

The Power of Restricted Splicing with Rules from a Regular Language. - Lila Kari; Gheorghe Paun; Arto Salomaa (J. Univers. Comput. Sci., 1996)

Pattern Systems. - Victor Mitrana; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Theor. Comput. Sci., 1996)

Computing by Splicing. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Theor. Comput. Sci., 1996)

Networks of Parallel Language Processors. - Erzsébet Csuhaj-Varjú; Arto Salomaa (New Trends in Formal Languages, 1997)

Shuffle-like Operations on omega-words. - Alexandru Mateescu; George Daniel Mateescu; Grzegorz Rozenberg; Arto Salomaa (New Trends in Formal Languages, 1997)

Syntactic and Semantic Aspects of Parallelism. - Alexandru Mateescu; Grzegorz Rozenberg; Arto Salomaa (Foundations of Computer Science: Potential - Theory - Cognition, 1997)

Watson-Crick finite automata. - Rudolf Freund; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (DNA Based Computers, 1997)

TWOPRIME: A Fast Stream Ciphering Algorithm. - Cunsheng Ding; Valtteri Niemi; Ari Renvall; Arto Salomaa (FSE, 1997)

Computing by splicing: programmed and evolving splicing systems. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (ICEC, 1997)

Lindenmayer and DNA: Watson-Crick D0L Systems. - Valeria Mihalache; Arto Salomaa (Bull. EATCS, 1997)

Conjugate Words, Cuts of the Deck and Cryptographic Protocols. - Arto Salomaa (Bull. EATCS, 1997)

Pattern Languages Versus Parallel Communicating Grammar Systems. - Sorina Dumitrescu; Gheorghe Paun; Arto Salomaa (Int. J. Found. Comput. Sci., 1997)

Geometric Transformations on Language Families: The Power of Symmetry. - Alexandru Mateescu; Grzegorz Rozenberg; Arto Salomaa (Int. J. Found. Comput. Sci., 1997)

Grammars with Controlled Derivations. - Jürgen Dassow; Gheorghe Paun; Arto Salomaa (Handbook of Formal Languages (2), 1997)

L Systems. - Lila Kari; Grzegorz Rozenberg; Arto Salomaa (Handbook of Formal Languages (1), 1997)

Formal Languages: an Introduction and a Synopsis. - Alexandru Mateescu; Arto Salomaa (Handbook of Formal Languages (1), 1997)

Aspects of Classical Language Theory. - Alexandru Mateescu; Arto Salomaa (Handbook of Formal Languages (1), 1997)

Families Generated by Grammars and L Systems. - Gheorghe Paun; Arto Salomaa (Handbook of Formal Languages (1), 1997)

DNA Computing - New Computing Paradigms. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Springer, 1998)

Shuffle on Trajectories: The Schützenberger Product and Related Operations. - Tero Harju; Alexandru Mateescu; Arto Salomaa (MFCS, 1998)

DNA Computing, Sticker Systems, and Universality. - Lila Kari; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa; Sheng Yu 001 (Acta Informatica, 1998)

A comparative overview ofcryptographic voting protocols. - Hannu Nurmi; Arto Salomaa (Ann. Oper. Res., 1998)

Complementarity versus universality: Keynotes of DNA computing. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Complex., 1998)

Simple Splicing Systems. - Alexandru Mateescu; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Discret. Appl. Math., 1998)

Networks of Language Processors: Parallel Communicating Systems. - Erzsébet Csuhaj-Varjú; Arto Salomaa (Bull. EATCS, 1998)

Characterizations of re languages starting from internal contextual languages. - Alexandru Mateescu; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Int. J. Comput. Math., 1998)

Language-theoretic aspects of string replication. - Valeria Mihalache; Arto Salomaa (Int. J. Comput. Math., 1998)

2-Testability and Relabelings Produce Everything. - Lucian Ilie; Arto Salomaa (J. Comput. Syst. Sci., 1998)

On Well Quasi Orders of Free Monoids. - Lucian Ilie; Arto Salomaa (Theor. Comput. Sci., 1998)

Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars. - Carlos Martín-Vide; Gheorghe Paun; Arto Salomaa (Theor. Comput. Sci., 1998)

Shuffle on Trajectories: Syntactic Constraints. - Alexandru Mateescu; Grzegorz Rozenberg; Arto Salomaa (Theor. Comput. Sci., 1998)

On the decomposition of finite languages. - Arto Salomaa; Sheng Yu 001 (Developments in Language Theory, 1999)

Caesar and DNA. Views on Cryptology. - Arto Salomaa (FCT, 1999)

DNA Computing: New Ideas and Paradigms. - Grzegorz Rozenberg; Arto Salomaa (ICALP, 1999)

Watson-Crick Walks and Roads on DOL Graphs. - Arto Salomaa (Acta Cybern., 1999)

Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring. - Alexandru Mateescu; Arto Salomaa (Bull. EATCS, 1999)

Contexts on trajectories. - Carlos Martín-Vide; Alexandru Mateescu; Grzegorz Rozenberg; Arto Salomaa (Int. J. Comput. Math., 1999)

Theoretical Computer Science. - William I. Gasarch; Arto Salomaa; Thomas H. Cormen; Lane A. Hemaspaandra; Milena Mihail (Handbook of Discrete and Combinatorial Mathematics, 1999)

Algebraic Representations of Regular Array Languages. - Rudolf Freund; Alexandru Mateescu; Arto Salomaa (Finite Versus Infinite, 2000)

Networks of Watson-Crick D0L Systems. - Erzsébet Csuhaj-Varjú; Arto Salomaa (Words, Languages & Combinatorics, 2000)

Compositions over a Finite Domain: From Completeness to Synchronizable Automata. - Arto Salomaa (A Half-Century of Automata Theory, 2000)

On the Expressiveness of Subset-Sum Representations. - Lucian Ilie; Arto Salomaa (Acta Informatica, 2000)

On strongly context-free languages. - Lucian Ilie; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Discret. Appl. Math., 2000)

Depth of Functional Compositions. - Arto Salomaa (Bull. EATCS, 2000)

Membrane Computing with External Output. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Fundam. Informaticae, 2000)

A characterization of poly-slender context-free languages. - Lucian Ilie; Grzegorz Rozenberg; Arto Salomaa (RAIRO Theor. Informatics Appl., 2000)

On slender 0L languages. - Taishin Y. Nishida; Arto Salomaa (Theor. Comput. Sci., 2000)

Networks of Language Processors: Parallel Communicating Systems. - Erzsébet Csuhaj-Varjú; Arto Salomaa (Current Trends in Theoretical Computer Science, 2001)

Simple Words in Equality Sets. - Marjo Lipponen; Arto Salomaa (Current Trends in Theoretical Computer Science, 2001)

Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring. - Alexandru Mateescu; Arto Salomaa (Current Trends in Theoretical Computer Science, 2001)

Lindenmayer and DNA: Watson-Crick D0L Systems. - Valeria Mihalache; Arto Salomaa (Current Trends in Theoretical Computer Science, 2001)

Sewing contexts and mildly context-sensitive languages. - Carlos Martín-Vide; Alexandru Mateescu; Arto Salomaa (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

Iterated Morphisms with Complementarity on the DNA Alphabet. - Arto Salomaa (Words, Semigroups, and Transductions, 2001)

Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. - Tero Harju; Oscar H. Ibarra; Juhani Karhumäki; Arto Salomaa (ICALP, 2001)

A sharpening of the Parikh mapping. - Alexandru Mateescu; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (RAIRO Theor. Informatics Appl., 2001)

Watson-Crick D0L systems with regular triggers. - Juha Honkala; Arto Salomaa (Theor. Comput. Sci., 2001)

Language-theoretic aspects of DNA complematarity. - Valeria Mihalache; Arto Salomaa (Theor. Comput. Sci., 2001)

Nondeterministic Trajectories. - Alexandru Mateescu; Arto Salomaa (Formal and Natural Computing, 2002)

Synchronization of Finite Automata: Contributions to an Old Problem. - Arto Salomaa (The Essence of Computation, 2002)

DNA Complementarity and Paradigms of Computing. - Arto Salomaa (COCOON, 2002)

Factorizations of Languages and Commutativity Conditions. - Alexandru Mateescu; Arto Salomaa; Sheng Yu 001 (Acta Cybern., 2002)

Some Decision Problems Concerning Semilinearity and Commutation. - Tero Harju; Oscar H. Ibarra; Juhani Karhumäki; Arto Salomaa (J. Comput. Syst. Sci., 2002)

Generation of Constants and Synchronization of Finite Automata. - Arto Salomaa (J. Univers. Comput. Sci., 2002)

Topics in the theory of DNA computing. - Martyn Amos; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Theor. Comput. Sci., 2002)

Operations and language generating devices suggested by the genome evolution. - Jürgen Dassow; Victor Mitrana; Arto Salomaa (Theor. Comput. Sci., 2002)

ICALP, EATCS and Maurice Nivat. - Grzegorz Rozenberg; Arto Salomaa (Theor. Comput. Sci., 2002)

Uni-transitional Watson-Crick D0L systems. - Arto Salomaa (Theor. Comput. Sci., 2002)

Three Constructions of Authentication/Secrecy Codes. - Cunsheng Ding; Arto Salomaa; Patrick Solé; Xiaojian Tian (AAECC, 2003)

Counting (scattered) Subwords. - Arto Salomaa (Bull. EATCS, 2003)

From Watson-Crick L systems to Darwinian P systems. - Erzsébet Csuhaj-Varjú; Carlos Martín-Vide; Gheorghe Paun; Arto Salomaa (Nat. Comput., 2003)

Cartesian authentication codes from functions with optimal nonlinearity. - Samuel T. Chanson; Cunsheng Ding; Arto Salomaa (Theor. Comput. Sci., 2003)

Power and size of extended Watson-Crick L systems. - Judit Csima; Erzsébet Csuhaj-Varjú; Arto Salomaa (Theor. Comput. Sci., 2003)

Composition sequences for functions over a finite domain. - Arto Salomaa (Theor. Comput. Sci., 2003)

Watson-Crick D0L systems: the power of one transition. - Arto Salomaa; Petr Sosík (Theor. Comput. Sci., 2003)

The Power of Networks of Watson-Crick D0L Systems. - Erzsébet Csuhaj-Varjú; Arto Salomaa (Aspects of Molecular Computing, 2004)

Matrix Indicators For Subword Occurrences And Ambiguity. - Alexandru Mateescu; Arto Salomaa (Int. J. Found. Comput. Sci., 2004)

Subword histories and Parikh matrices. - Alexandru Mateescu; Arto Salomaa; Sheng Yu 001 (J. Comput. Syst. Sci., 2004)

On the state complexity of reversals of regular languages. - Arto Salomaa; Derick Wood; Sheng Yu 001 (Theor. Comput. Sci., 2004)

On the Injectivity of Parikh Matrix Mappings. - Arto Salomaa (Fundam. Informaticae, 2005)

Connections between subwords and certain matrix mappings. - Arto Salomaa (Theor. Comput. Sci., 2005)

Secret Sharing Schemes with Nice Access Structures. - Cunsheng Ding; Arto Salomaa (Fundam. Informaticae, 2006)

On Some Problems of Mateescu Concerning Subword Occurrences. - Cunsheng Ding; Arto Salomaa (Fundam. Informaticae, 2006)

Subword conditions and subword histories. - Arto Salomaa; Sheng Yu 001 (Inf. Comput., 2006)

Independence of certain quantities indicating subword occurrences. - Arto Salomaa (Theor. Comput. Sci., 2006)

On Languages Defined by Numerical Parameters. - Arto Salomaa (Formal Models, Languages and Applications, 2007)

State Complexity of Basic Operations Combined with Reversal. - Guangwu Liu; Carlos Martín-Vide; Arto Salomaa; Sheng Yu 001 (LATA, 2007)

Subword Balance in BinaryWords, Languages and Sequences. - Arto Salomaa (Fundam. Informaticae, 2007)

Spiking Neural P Systems: an Early Survey. - Gheorghe Paun; Mario J. Pérez-Jiménez; Arto Salomaa (Int. J. Found. Comput. Sci., 2007)

Comparing Subword Occurrences in Binary D0L Sequences. - Arto Salomaa (Int. J. Found. Comput. Sci., 2007)

On the existence of prime decompositions. - Yo-Sub Han; Arto Salomaa; Kai Salomaa; Derick Wood; Sheng Yu 001 (Theor. Comput. Sci., 2007)

State complexity of combined operations. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Theor. Comput. Sci., 2007)

Length Codes, Products of Languages and Primality. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (LATA, 2008)

State complexity of basic language operations combined with reversal. - Guangwu Liu; Carlos Martín-Vide; Arto Salomaa; Sheng Yu 001 (Inf. Comput., 2008)

Subword histories and associated matrices. - Arto Salomaa (Theor. Comput. Sci., 2008)

Characteristic Words for Parikh Matrices. - Arto Salomaa (Automata, Formal Languages, and Related Topics, 2009)

Grzegorz Rozenberg: A Magical Scientist and Brother. - Arto Salomaa (Algorithmic Bioprocesses, 2009)

Variants of codes and indecomposable languages. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Inf. Comput., 2009)

Subword Occurrences, Parikh Matrices and Lyndon Images. - Arto Salomaa; Sheng Yu 001 (Int. J. Found. Comput. Sci., 2010)

Subword balance, position indices and power sums. - Arto Salomaa (J. Comput. Syst. Sci., 2010)

Seventy Years Derick Wood. - Helmut Jürgensen; Hermann A. Maurer; Arto Salomaa; Sheng Yu 001 (J. Univers. Comput. Sci., 2010)

Ordered Catenation Closures and Decompositions of Languages Related to a Language of Derick Wood. - Arto Salomaa (J. Univers. Comput. Sci., 2010)

Criteria for the matrix equivalence of words. - Arto Salomaa (Theor. Comput. Sci., 2010)

On Some Biologically Motivated Control Devices for Parallel Rewriting. - Arto Salomaa (Computation, Cooperation, and Life, 2011)

Undecidability of the State Complexity of Composed Regular Operations. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (LATA, 2011)

Preface. - Juhani Karhumäki; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Fundam. Informaticae, 2011)

Power Sums Associated with Certain Recursive Procedures on Words. - Arto Salomaa (Int. J. Found. Comput. Sci., 2011)

Composition Sequences and Synchronizing Automata. - Arto Salomaa (Computation, Physics and Beyond, 2012)

On State Sequences Defined by Reaction Systems. - Arto Salomaa (Logic and Program Semantics, 2012)

Undecidability of State Complexities Using Mirror Images. - Arto Salomaa (Languages Alive, 2012)

In Memoriam Sheng Yu (1950-2012). - Arto Salomaa (Bull. EATCS, 2012)

Mirror Images and Schemes for the Maximal Complexity of Nondeterminism. - Arto Salomaa (Fundam. Informaticae, 2012)

Sheng Yu (1950-2012) In Memoriam. - Arto Salomaa; Kai Salomaa; Andrew L. Szilard (Fundam. Informaticae, 2012)

Sheng Yu. - Francis Y. L. Chin; Oscar H. Ibarra; Sartaj Sahni; Arto Salomaa (Int. J. Found. Comput. Sci., 2012)

Preface. - Giorgio Ausiello; Hendrik Jan Hoogeboom; Juhani Karhumäki; Ion Petre; Arto Salomaa (Theor. Comput. Sci., 2012)

Preface. - Grzegorz Rozenberg; Arto Salomaa (Theor. Comput. Sci., 2012)

Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism. - Arto Salomaa (Theor. Comput. Sci., 2012)

Functions and sequences generated by reaction systems. - Arto Salomaa (Theor. Comput. Sci., 2012)

Undecidability of state complexity. - Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Int. J. Comput. Math., 2013)

Functional Constructions between reaction Systems and Propositional Logic. - Arto Salomaa (Int. J. Found. Comput. Sci., 2013)

Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012. - Arto Salomaa; Kai Salomaa; Andrew L. Szilard (Int. J. Found. Comput. Sci., 2013)

Minimal and almost minimal reaction systems. - Arto Salomaa (Nat. Comput., 2013)

On Axiomatizations of General Many-Valued Propositional Calculi. - Arto Salomaa (Discrete Mathematics and Computer Science, 2014)

Minimal Reaction Systems Defining Subset Functions. - Arto Salomaa (Computing with New Resources, 2014)

Wilfried Brauer (1937-2014) in memoriam. - Grzegorz Rozenberg; Arto Salomaa (Bull. EATCS, 2014)

Compositions of Reaction Systems. - Arto Salomaa (J. Autom. Lang. Comb., 2014)

Two-Step Simulations of Reaction Systems by Minimal Ones. - Arto Salomaa (Acta Cybern., 2015)

Alberto Apostolico. - Arto Salomaa; Francis Y. L. Chin; Oscar H. Ibarra; Sartaj Sahni (Int. J. Found. Comput. Sci., 2015)

Applications of the Chinese remainder theorem to reaction systems with duration. - Arto Salomaa (Theor. Comput. Sci., 2015)

Depth of Closed Classes of Truth Functions in Many-Valued Logic. - Arto Salomaa (The Role of Theory in Computer Science, 2017)

Ambiguity, Nondeterminism and State Complexity of Finite Automata. - Yo-Sub Han; Arto Salomaa; Kai Salomaa (Acta Cybern., 2017)

Preface. - Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Fundam. Informaticae, 2017)

From finite state grammars to natural computing - In memory of Solomon Marcus. - Gheorghe Paun; Ion Petre; Grzegorz Rozenberg; Arto Salomaa (Theor. Comput. Sci., 2017)

Minimal reaction systems: Duration and blips. - Arto Salomaa (Theor. Comput. Sci., 2017)

Parikh Matrices: Subword Indicators and Degrees of Ambiguity. - Arto Salomaa (Adventures Between Lower Bounds and Higher Altitudes, 2018)

From Infinite to Finite by Identifying Variables in Many-Valued Logic. - Arto Salomaa (J. Autom. Lang. Comb., 2018)

Preface of the special issue for Gheorghe Pǎun's 70th anniversary. - Marian Gheorghe 001; Mario J. Pérez-Jiménez; Grzegorz Rozenberg; Arto Salomaa (J. Membr. Comput., 2020)

A fascinating rainbow of computation - Honoring Gheorghe Păun on the occasion of his 70th birthday. - Lila Kari; Ion Petre; Grzegorz Rozenberg; Arto Salomaa (Theor. Comput. Sci., 2021)

Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude). - Alastair A. Abbott; Cezar Câmpeanu; Ludwig Staiger; Marius Zimand; Arto Salomaa (Theor. Comput. Sci., 2023)

Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) - Preface. - Manfred Droste; George Rahonis; Arto Salomaa (Int. J. Found. Comput. Sci., 2023)

Descriptional Complexity of Finite Automata - Selected Highlights. - Arto Salomaa; Kai Salomaa; Taylor J. Smith (Fundam. Informaticae, 2024)

Volume Edited by Magnus Steinby. - Arto Salomaa; Magnus Steinby (Int. J. Found. Comput. Sci., 2024)