Arto Salomaa

发表

Parallel Composition of Words with Re-entrant Symbols

Arto Salomaa, Alexandru Mateescu, 1996 .

Algorithmically Coding the Universe

Cristian S. Calude, Arto Salomaa, A. Salomaa, 1993, Developments in Language Theory.

Nonterminals, homomorphisms and codings in different variations of OL-systems

Sven Skyum, Grzegorz Rozenberg, Arto Salomaa, 2004, Acta Informatica.

Grammars Based on the Shuffle Operation

Grzegorz Rozenberg, Arto Salomaa, Gheorghe Păun, 1995, J. Univers. Comput. Sci..

The Ehrenfeucht conjecture: a proof for language theorists

Arto Salomaa, 1985, Bull. EATCS.

Clay Robert E.. A standard form for Łukasiewicz many-valued logics. Notre Dame journal of formal logic, vol. 4 (1963), pp. 59–66.

Arto Salomaa, 1965 .

Algebraic Representations of Regular Array Languages

Rudolf Freund, Arto Salomaa, Alexandru Mateescu, 2000, Finite Versus Infinite.

Uni-transitional Watson-Crick D0L systems

Arto Salomaa, 2002, Theor. Comput. Sci..

Uniform Interpretations of L Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1978, Inf. Control..

Probabilistic and Weighted Grammars

Arto Salomaa, A. Salomaa, 1969, Inf. Control..

Networks of Parallel Language Processors

Erzsébet Csuhaj-Varjú, Arto Salomaa, E. Csuhaj-Varjú, 1997, New Trends in Formal Languages.

The Formal Language Theory Column

Arto Salomaa, A. Salomaa, 1987, Bull. EATCS.

Parallelism in Rewriting Systems

Arto Salomaa, A. Salomaa, 1974, ICALP.

Cartesian authentication codes from functions with optimal nonlinearity

Cunsheng Ding, Arto Salomaa, Samuel T. Chanson, 2003, Theor. Comput. Sci..

Depth of Functional Compositions

Arto Salomaa, 2000, Bull. EATCS.

Structures in Logic and Computer Science

Grzegorz Rozenberg, Arto Salomaa, Jan Mycielski, 1997, Lecture Notes in Computer Science.

Introduction to Formal Language Theory

Grzegorz Rozenberg, Arto Salomaa, Gheorghe Păun, 1998 .

Synchronization of Finite Automata: Contributions to an Old Problem

Arto Salomaa, A. Salomaa, 2002, The Essence of Computation.

Subword balance, position indices and power sums

Arto Salomaa, 2010, J. Comput. Syst. Sci..

Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars

Carlos Martín-Vide, Gheorghe Paun, Arto Salomaa, 1998, Theor. Comput. Sci..

Computing by splicing: programmed and evolving splicing systems

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

Connections between subwords and certain matrix mappings

Arto Salomaa, 2005, Theor. Comput. Sci..

On the Form Equivalence of L-Forms

Hermann A. Maurer, Arto Salomaa, Thomas Ottmann, 1977, Theor. Comput. Sci..

Nondeterminism in Patterns

Arto Salomaa, Alexandru Mateescu, 1994, STACS.

Minimal and almost minimal reaction systems

Arto Salomaa, 2013, Natural Computing.

On slender 0L languages

Arto Salomaa, Taishin Y. Nishida, 2000, Theor. Comput. Sci..

Uniform Interpretations of Grammar Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, SIAM J. Comput..

Decidability and density in two-symbol grammar forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, Discret. Appl. Math..

On the equivalence of grammars inferred from derivation

Arto Salomaa, Efim B. Kinber, Sheng Yu, 1986, Bull. EATCS.

On Good E0L Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1978, SIAM J. Comput..

Depth of Closed Classes of Truth Functions in Many-Valued Logic

Arto Salomaa, 2017, The Role of Theory in Computer Science.

Handbook of formal languages, vol. 2: linear modeling: background and application

Grzegorz Rozenberg, Arto Salomaa, G. Rozenberg, 1997 .

On Infinite Words Obtained by Iterating Morphisms

Arto Salomaa, Karel Culik, A. Salomaa, 1982, Theor. Comput. Sci..

Subword histories and Parikh matrices

Arto Salomaa, Alexandru Mateescu, Sheng Yu, 2004, J. Comput. Syst. Sci..

From DNA Recombination to DNA Computing, Via Formal Languages

Gheorghe Paun, Arto Salomaa, G. Paun, 1996, German Conference on Bioinformatics.

Universality by Finite H Systems

Grzegorz Rozenberg, Arto Salomaa, Gheorghe Păun, 1998 .

Patterns

Arto Salomaa, 1994, Bull. EATCS.

Generalised DOL Trees

Grzegorz Rozenberg, Lila Kari, Arto Salomaa, 1995, Acta Cybern..

Watson—Crick Automata

Grzegorz Rozenberg, Arto Salomaa, Gheorghe Păun, 1998 .

Membrane Computing with External Output

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2000, Fundam. Informaticae.

Table systems with unconditional transfer

Grzegorz Rozenberg, Arto Salomaa, 1981, Discret. Appl. Math..

Spiking Neural P Systems: an Early Survey

Gheorghe Paun, Arto Salomaa, Mario J. Pérez-Jiménez, 2007, Int. J. Found. Comput. Sci..

Aspects of Classical Language Theory

Arto Salomaa, Alexandru Mateescu, A. Salomaa, 1997, Handbook of Formal Languages.

Developments in Language Theory II, At the Crossroads of Mathematics, Computer Science and Biology, Magdeburg, Germany, 17-21 July 1995

Grzegorz Rozenberg, Arto Salomaa, Jürgen Dassow, 1996, Developments in Language Theory.

Synchronized EOL Forms Under Uniform Interpretation

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, RAIRO Theor. Informatics Appl..

Secret Selling of Secrets with Several Buyers

Lila Kari, Arto Salomaa, 1990, Bull. EATCS.

Formal Power Series and Growth Functions of Lindenmayer Systems

Arto Salomaa, 1975, MFCS.

Membrane Computing - 17th International Conference, CMC 2016, Milan, Italy, July 25-29, 2016, Revised Selected Papers

Grzegorz Rozenberg, Arto Salomaa, Alberto Leporati, 2017, Int. Conf. on Membrane Computing.

Many aspects of formal languages

Arto Salomaa, A. Salomaa, 1991, Inf. Sci..

Language-theoretic problems arising from Richelieu cryptosystems

Gheorghe Paun, Arto Salomaa, Jürgen Dassow, 1993, Theor. Comput. Sci..

Syntactic monoids in the construction of systolic tree automata

Arto Salomaa, Helmut Jürgensen, 2004, International Journal of Computer & Information Sciences.

Ordered Catenation Closures and Decompositions of Languages Related to a Language of Derick Wood

Arto Salomaa, A. Salomaa, 2010, J. Univers. Comput. Sci..

Comparing Subword Occurrences in Binary D0L Sequences

Arto Salomaa, 2007, Int. J. Found. Comput. Sci..

Watson-Crick Walks and Roads on DOL Graphs

Arto Salomaa, 1999, Acta Cybern..

Two Complete Axiom Systems for the Algebra of Regular Events

Arto Salomaa, A. Salomaa, 1966, JACM.

Developmental systems with fragmentation

Grzegorz Rozenberg, Arto Salomaa, Keijo Ruohonen, 1975 .

Systolic Tree Acceptors

Derick Wood, Arto Salomaa, Karel Culik, 1984, RAIRO Theor. Informatics Appl..

Developments in Language Theory, At the Crossroads of Mathematics, Computer Science and Biology, Turku, Finland, 12-15 July 1993

Grzegorz Rozenberg, Arto Salomaa, 1994, Developments in Language Theory.

Watson-Crick finite automata

Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg, 1997, DNA Based Computers.

Sheng Yu

Oscar H. Ibarra, Sartaj Sahni, Arto Salomaa, 2012, Int. J. Found. Comput. Sci..

Contextual Grammars: Parallelism and Blocking of Derivation

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1996, Fundam. Informaticae.

Public-Key Cryptography

Arto Salomaa, A. Salomaa, 1996, Texts in Theoretical Computer Science. An EATCS Series.

Functions and sequences generated by reaction systems

Arto Salomaa, 2012, Theor. Comput. Sci..

Current Trends in Theoretical Computer Science: The Challenge of the New Century

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2004 .

Wilfried Brauer (1937-2014) in memoriam

Grzegorz Rozenberg, Arto Salomaa, 2014, Bull. EATCS.

Minimal reaction systems: Duration and blips

Arto Salomaa, 2017, Theor. Comput. Sci..

Revised Papers from the International Workshop on Membrane Computing

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2002 .

Applications of rational series

Arto Salomaa, Matti Soittola, 1978 .

Public-Key Cryptography

Arto Salomaa, A. Salomaa, 1991, EATCS Monographs on Theoretical Computer Science.

Insertion-Deletion Systems

Grzegorz Rozenberg, Arto Salomaa, Gheorghe Păun, 1998 .

Parikh Prime Words and GO-like Territories

Grzegorz Rozenberg, Arto Salomaa, Alexandru Mateescu, 1995, J. Univers. Comput. Sci..

Classical Two-Way Cryptography

Arto Salomaa, 1996 .

Formal languages

Arto Salomaa, A. Salomaa, 1973, Computer science classics.

Periodically Time-Variant Context-Free Grammars

Arto Salomaa, A. Salomaa, 1970, Inf. Control..

Undecidability of the State Complexity of Composed Regular Operations

Arto Salomaa, Sheng Yu, Kai Salomaa, 2011, LATA.

Membrane Computing - 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers

David Corne, Grzegorz Rozenberg, Arto Salomaa, 2009, Workshop on Membrane Computing.

On generators and generative capacity of EOL forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 2004, Acta Informatica.

Solution of a decision problem concerning unary Lindenmayer systems

Arto Salomaa, 1974, Discret. Math..

EOL forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 2004, Acta Informatica.

Matrix Grammars with a Leftmost Restriction

Arto Salomaa, A. Salomaa, 1972, Inf. Control..

Compositions of Reaction Systems

Arto Salomaa, 2014, J. Autom. Lang. Comb..

Composition sequences for functions over a finite domain

Arto Salomaa, A. Salomaa, 2003, Theor. Comput. Sci..

A homomorphic characterization of regular languages

Faith Ellen, Arto Salomaa, Karel Culik, 1982, Discret. Appl. Math..

Counting (scattered) Subwords

Arto Salomaa, 2003, Bull. EATCS.

Synchronized E0L Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1980, Theor. Comput. Sci..

Language-theoretic aspects of DNA complematarity

Arto Salomaa, Valeria Mihalache, 2001, Theor. Comput. Sci..

The Idea of Public Keys

Arto Salomaa, 1996 .

Grammatical Families

Arto Salomaa, A. Salomaa, 1980, ICALP.

On Regular Characterizations of Languages by Grammar Systems

Lucian Ilie, Arto Salomaa, 1996, Acta Cybern..

Preface

Ion Petre, Arto Salomaa, Giorgio Ausiello, 2012, Theor. Comput. Sci..

Undecidability of state complexity

Arto Salomaa, Sheng Yu, Kai Salomaa, 2013, Int. J. Comput. Math..

On the state complexity of reversals of regular languages

Derick Wood, Arto Salomaa, Sheng Yu, 2004, Theor. Comput. Sci..

On non context-free grammar forms

Derick Wood, Martti Penttonen, Hermann A. Maurer, 2005, Mathematical systems theory.

A Supernormal-Form Theorem for Context-Free Grammars

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1983, JACM.

Gramars with Oracles

Gheorghe Paun, Lila Kari, Arto Salomaa, 1993, Sci. Ann. Cuza Univ..

On Finite Automata with a Time-Variant Structure

Arto Salomaa, A. Salomaa, 1968, Inf. Control..

Families Generated by Grammars and L Systems

Gheorghe Paun, Arto Salomaa, 1997, Handbook of Formal Languages.

Handbook of formal languages. background and application

Grzegorz Rozenberg, Arto Salomaa, G. Rozenberg, 1997 .

Pattern Systems

Victor Mitrana, Gheorghe Paun, Grzegorz Rozenberg, 1996, Theor. Comput. Sci..

On some recent problems concerning developmental languages

Arto Salomaa, A. Salomaa, 1973, Automatentheorie und Formale Sprachen.

ICALP, EATCS and Maurice Nivat

Grzegorz Rozenberg, Arto Salomaa, 2002, Theor. Comput. Sci..

Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms

Hermann A. Maurer, Arto Salomaa, Karel Culik, 1978, Theor. Comput. Sci..

On Some Problems of Mateescu Concerning Subword Occurrences

Cunsheng Ding, Arto Salomaa, 2006, Fundam. Informaticae.

Cryptography and Data Security

Arto Salomaa, 1988, IMYCS.

Power Sums Associated with Certain Recursive Procedures on Words

Arto Salomaa, 2011, Int. J. Found. Comput. Sci..

Beginnings of Molecular Computing

Grzegorz Rozenberg, Arto Salomaa, Gheorghe Păun, 1998 .

5th International Workshop on Membrane Computing

Giancarlo Mauri, Gheorghe Paun, Grzegorz Rozenberg, 2005 .

Secret ballot elections in computer networks

Lila Kari, Arto Salomaa, Hannu Nurmi, 1991, Computers & security.

On regular expressions and regular canonical systems

Arto Salomaa, 2005, Mathematical systems theory.

Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View

Cristian S. Calude, Gheorghe Paun, Grzegorz Rozenberg, 2000 .

Rainbow of Computer Science - Dedicated to Hermann Maurer on the Occasion of His 70th Birthday

Cristian S. Calude, Grzegorz Rozenberg, Arto Salomaa, 2011, Rainbow of Computer Science.

ICALP'88: Proceedings of the 15th International Colloquium on Automata, Languages and Programming

Arto Salomaa, Timo Lepistö, 1988 .

Geometric Transformations on Language Families: The Power of Symmetry

Grzegorz Rozenberg, Arto Salomaa, Alexandru Mateescu, 1997, Int. J. Found. Comput. Sci..

Multi-Pattern Languages

Gheorghe Paun, Lila Kari, Arto Salomaa, 1995, Theor. Comput. Sci..

On the Index of a Context-Free Grammar and Language

Arto Salomaa, A. Salomaa, 1969, Inf. Control..

Managing Editor’s Column

Cristian S. Calude, Hermann A. Maurer, Arto Salomaa, 1996 .

State complexity of combined operations

Arto Salomaa, Sheng Yu, Kai Salomaa, 2007, Theor. Comput. Sci..

Return to Patterns

Arto Salomaa, A. Salomaa, 1995, Bull. EATCS.

A Pumping Result for 2-Context-Free Languages

Arto Salomaa, 1988, Theor. Comput. Sci..

Computability Paradigms Based OnDNA Complementarity

Arto Salomaa, 1970 .

On Some Biologically Motivated Control Devices for Parallel Rewriting

Arto Salomaa, 2011, Computation, Cooperation, and Life.

Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009. Revised Selected and Invited Papers

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2010, Workshop on Membrane Computing.

Handbook of formal languages, vol. 3: beyond words

Grzegorz Rozenberg, Arto Salomaa, G. Rozenberg, 1997 .

On Languages Defined by Numerical Parameters

Arto Salomaa, 2007, Formal Models, Languages and Applications.

Networks of Watson-Crick D0L Systems

Erzsébet Csuhaj-Varjú, Arto Salomaa, 2000, Words, Languages & Combinatorics.

Cryptographic Protocols: Surprising Vistas for Communication

Arto Salomaa, 1990 .

A characterization of poly-slender context-free languages

Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa, 2000, RAIRO Theor. Informatics Appl..

Introduction: Models of Computation

Arto Salomaa, 1985 .

Primary Types of Instances of the Post Correspondence Problem

Arto Salomaa, Sheng Yu, Kai Salomaa, 1991, Bull. EATCS.

Developments in Language Theory II

Grzegorz Rozenberg, Arto Salomaa, Jürgen Dassow, 2002 .

Conducting secret ballot elections in computer networks: Problems and solutions

Arto Salomaa, Hannu Nurmi, 1994, Ann. Oper. Res..

Power from Power Series

Arto Salomaa, 1979, MFCS.

In Memoriam Sheng Yu (1950-2012)

Arto Salomaa, 2012, Bull. EATCS.

2-Testability and Relabelings Produce Everything

Lucian Ilie, Arto Salomaa, A. Salomaa, 1998, J. Comput. Syst. Sci..

On State Sequences Defined by Reaction Systems

Arto Salomaa, 2012, Logic and Program Semantics.

Parikh Prime Words and GO-like Territories

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1995, J. Univers. Comput. Sci..

Finitary and infinitary interpretations of languages

Derick Wood, Hermann A. Maurer, Arto Salomaa, 2005, Mathematical systems theory.

Systolic Trellis Automata: Stability, Decidability and Complexity

Arto Salomaa, Jozef Gruska, Karel Culik, 1986, Inf. Control..

Secret ballot elections and public-key cryptosystems

Arto Salomaa, Hannu Nurmi, 1992 .

Ambiguity, Nondeterminism and State Complexity of Finite Automata

Arto Salomaa, Yo-Sub Han, Kai Salomaa, 2017, Acta Cybern..

Deletion Sets

Gheorghe Paun, Lila Kari, Arto Salomaa, 1993, Fundam. Informaticae.

Contexts on trajectories

Carlos Martín-Vide, Grzegorz Rozenberg, Arto Salomaa, 1998, Int. J. Comput. Math..

Shuffle on Trajectories: Syntactic Constraints

Grzegorz Rozenberg, Arto Salomaa, Alexandru Mateescu, 1998, Theor. Comput. Sci..

On the existence of prime decompositions

Derick Wood, Arto Salomaa, Sheng Yu, 2007, Theor. Comput. Sci..

Language-theoretic aspects of string replication

Arto Salomaa, Valeria Mihalache, 1998, Int. J. Comput. Math..

Ambiguity and Decision Problems Concerning Number Systems

Arto Salomaa, Karel Culik, 1983, Inf. Control..

PCP-Prime Words and Primality Types

Arto Salomaa, Alexandru Mateescu, A. Salomaa, 1993, RAIRO Theor. Informatics Appl..

Grammars with Controlled Derivations

Gheorghe Paun, Arto Salomaa, Jürgen Dassow, 1997, Handbook of Formal Languages.

Decision problems arising from knapsack transformations

Arto Salomaa, 1990, Acta Cybern..

Iteration Grammars and Lindenmayer AFL's

Arto Salomaa, A. Salomaa, 1974, L Systems.

Completeness of Context-Free Grammar Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, J. Comput. Syst. Sci..

Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring

Arto Salomaa, Alexandru Mateescu, 1999, Bull. EATCS.

New squeezing mechanisms for L systems

Grzegorz Rozenberg, Arto Salomaa, 1977, Inf. Sci..

Membrane Computing : 11th International Conference, CMC 2010, Jena, Germany, August 24-27, 2010. Revised Selected Papers

Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, 2011 .

Subword histories and associated matrices

Arto Salomaa, A. Salomaa, 2008, Theor. Comput. Sci..

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)

Gheorghe Paun, Arto Salomaa, 1997 .

L-Systems: A Device in Biologically Motivated Automata Theory

Arto Salomaa, 1973, MFCS.

Thin and Slender Languages

Gheorghe Paun, Arto Salomaa, G. Paun, 1995, Discret. Appl. Math..

Simple Reductions Between D0L Language and Sequence Equivalence Problems

Arto Salomaa, 1993, Discret. Appl. Math..

Subword Balance in BinaryWords, Languages and Sequences

Arto Salomaa, 2007, Fundam. Informaticae.

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa

Arto Salomaa, 1999, Jewels are Forever.

Proceedings of the Fourth Colloquium on Automata, Languages and Programming

Arto Salomaa, Magnus Steinby, 1977 .

Nondeterministic Trajectories

Arto Salomaa, Alexandru Mateescu, 2002, Formal and Natural Computing.

On the decomposition of finite languages

Arto Salomaa, Sheng Yu, 1999, Developments in Language Theory.

Decidability in finite automata

Arto Salomaa, 1990, Bull. EATCS.

Membrane Computing: 7th International Workshop, WMC 2006, Leiden, Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers (Lecture Notes in Computer Science)

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2007 .

Independence of certain quantities indicating subword occurrences

Arto Salomaa, 2006, Theor. Comput. Sci..

Pattern Languages Versus Parallel Communicating Grammar Systems

Sorina Dumitrescu, Gheorghe Paun, Arto Salomaa, 1997, Int. J. Found. Comput. Sci..

Review: Seymour Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages

Arto Salomaa, 1976 .

Relative Goodness for EOL Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1978, RAIRO Theor. Informatics Appl..

Length Codes, Products of Languages and Primality

Arto Salomaa, Sheng Yu, Kai Salomaa, 2008, LATA.

Applications of the Chinese remainder theorem to reaction systems with duration

Arto Salomaa, 2015, Theor. Comput. Sci..

Seventy Years Derick Wood

Hermann A. Maurer, Arto Salomaa, Sheng Yu, 2010, J. Univers. Comput. Sci..

DNA Computing

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1998, Texts in Theoretical Computer Science.

Famous Decision Problems

Arto Salomaa, 1985 .

Closure Properties of Slender Languages

Gheorghe Paun, Arto Salomaa, G. Paun, 1993, Theor. Comput. Sci..

On Cooperatively Distributed Ciphering and Hashing

Cunsheng Ding, Arto Salomaa, 1996, Comput. Artif. Intell..

Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]

Hartmut Ehrig, Wilfried Brauer, Arto Salomaa, 2002 .

On sentential forms of context-free grammars

Arto Salomaa, 2004, Acta Informatica.

Alberto Apostolico

Oscar H. Ibarra, Sartaj Sahni, Arto Salomaa, 2015, Int. J. Found. Comput. Sci..

Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012

Arto Salomaa, Kai Salomaa, Andrew L. Szilard, 2013, Int. J. Found. Comput. Sci..

Sub-Regular Grammar Forms

Derick Wood, Arto Salomaa, Thomas Ottmann, 1981, Inf. Process. Lett..

Operations and language generating devices suggested by the genome evolution

Victor Mitrana, Arto Salomaa, Jürgen Dassow, 2002, Theor. Comput. Sci..

Other Bases of Cryptosystems

Arto Salomaa, 1996 .

Characteristic Words for Parikh Matrices

Arto Salomaa, 2009, Automata, Formal Languages, and Related Topics.

On a homomorphic characterization of recursively enumerable languages

Arto Salomaa, 1973 .

P, NP and the Post Correspondence Problem

Arto Salomaa, Alexandru Mateescu, Sheng Yu, 1995, Inf. Comput..

Equality sets for homomorphisms of free monoids

Arto Salomaa, 1978, Acta Cybern..

A Deterministic Algorithm for Modular Knapsack Problems

Arto Salomaa, 1991, Theor. Comput. Sci..

Pure Grammars

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1980, Inf. Control..

From Parikh vectors to GO territories

Arto Salomaa, 1995, Bull. EATCS.

Recent Results on L Systems

Arto Salomaa, 1976, MFCS.

L Codes and L Systems with Immigration

Arto Salomaa, 1991, Bull. EATCS.

Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages

Tero Harju, Oscar H. Ibarra, Arto Salomaa, 2001, ICALP.

L Morphisms: Bounded Delay and Regularity of Ambiguity

Juha Honkala, Arto Salomaa, A. Salomaa, 1991, ICALP.

Slender 0L Languages

Arto Salomaa, Taishin Y. Nishida, A. Salomaa, 1996, Theor. Comput. Sci..

The Book of L

Grzegorz Rozenberg, Arto Salomaa, G. Rozenberg, 1986, Springer Berlin Heidelberg.

In the prehistory of formal language theory: Gauss Languages

Gheorghe Paun, Lila Kari, Arto Salomaa, 1992, Bull. EATCS.

Variants of codes and indecomposable languages

Arto Salomaa, Sheng Yu, Kai Salomaa, 2009, Inf. Comput..

Composition Sequences and Synchronizing Automata

Arto Salomaa, A. Salomaa, 2012, Computation, Physics and Beyond.

Public-Key Cryptosystems and Language Theory

Arto Salomaa, 1989, A Perspective in Theoretical Computer Science.

Automata-Theoretic Aspects of Formal Power Series

Arto Salomaa, Matti Soittola, A. Salomaa, 1978, Texts and Monographs in Computer Science.

Undecidability of State Complexities Using Mirror Images

Arto Salomaa, A. Salomaa, 2012, Languages Alive.

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model

Arto Salomaa, Alexandru Mateescu, Sheng Yu, 1996 .

Algebraic series and context-free languages

Arto Salomaa, Matti Soittola, 1978 .

Colorings and interpretations: a connection between graphs and grammar forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, Discret. Appl. Math..

Watson-crick D0l Systems

Arto Salomaa, Petr Sosík, V. Mihalache, 1997 .

Verifying and Recasting Secret Ballots in Computer Networks

Arto Salomaa, A. Salomaa, 1991, New Results and New Trends in Computer Science.

Some Decision Problems Concerning Semilinearity and Commutation

Tero Harju, Oscar H. Ibarra, Arto Salomaa, 2002, J. Comput. Syst. Sci..

On some Decidability Problems Concerning Developmental Languages

Arto Salomaa, 1975 .

Secret Sharing Schemes with Nice Access Structures

Cunsheng Ding, Arto Salomaa, A. Salomaa, 2006, Fundam. Informaticae.

A Half-Century of Automata Theory: Celebration and Inspiration

Derick Wood, Arto Salomaa, Sheng Yu, 2001, A Half-Century of Automata Theory.

Conditional Tabled Eco-Grammar Systems

Erzsébet Csuhaj-Varjú, Gheorghe Paun, Arto Salomaa, 1995, J. Univers. Comput. Sci..

Topics in the theory of DNA computing

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2002, Theor. Comput. Sci..

Syntactic and Semantic Aspects of Parallelism

Grzegorz Rozenberg, Arto Salomaa, Alexandru Mateescu, 1997, Foundations of Computer Science: Potential - Theory - Cognition.

Preface [to WMC 2003 - 4th International Workshop on Membrane Computing, Revised selected papers]

Carlos Martín-Vide, Gheorghe Paun, Grzegorz Rozenberg, 2004 .

Subword conditions and subword histories

Arto Salomaa, Sheng Yu, A. Salomaa, 2006, Inf. Comput..

Grammars Based on Patterns

Gheorghe Paun, Arto Salomaa, Jürgen Dassow, 1993, Int. J. Found. Comput. Sci..

Decision Problems for Patterns

Tao Jiang, Arto Salomaa, Sheng Yu, 1995, J. Comput. Syst. Sci..

Conditional Tabled Eco-Grammar Systems versus (E)TOL Systems

Erzsébet Csuhaj-Varjú, Arto Salomaa, Gheorghe Păun, 1996 .

From Watson-Crick L systems to Darwinian P systems

Carlos Martín-Vide, Erzsébet Csuhaj-Varjú, Gheorghe Paun, 2004, Natural Computing.

On a Family of L Languages Resulting from Systolic Tree Automata

Arto Salomaa, Jozef Gruska, Karel Culik, 1983, Theor. Comput. Sci..

When L was Young

Grzegorz Rozenberg, Arto Salomaa, 1986 .

Grammatical Models of Multi-Agent Systems

Arto Salomaa, Gheorghe Păun, 1999, Grammatical Models of Multi-Agent Systems.

Algorithms and Programs

Grzegorz Rozenberg, Arto Salomaa, W. Brauer, 2005 .

On simplest possible solutions for Post Correspondence Problems

Arto Salomaa, Alexandru Mateescu, A. Salomaa, 1993, Acta Informatica.

Formal and Natural Computing

Hartmut Ehrig, Wilfried Brauer, Arto Salomaa, 2002, Lecture Notes in Computer Science.

Membrane Computing

Grzegorz Rozenberg, Arto Salomaa, G. Pǎun, 2003, Lecture Notes in Computer Science.

ETOL Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1978, J. Comput. Syst. Sci..

Test Sets and Checking Words for Homomorphism Equivalence

Arto Salomaa, Karel Culik, 1980, J. Comput. Syst. Sci..

Handbook of formal languages, vol. 1: word, language, grammar

Grzegorz Rozenberg, Arto Salomaa, G. Rozenberg, 1997 .

Characterizations of re languages starting from internal contextual languages

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1998, Int. J. Comput. Math..

The Power of Restricted Splicing with Rules from a Regular Language

Gheorghe Paun, Lila Kari, Arto Salomaa, 1996, J. Univers. Comput. Sci..

Automata, languages and programming : fourth colloquium, University of Turku, Finland, July 18-22, 1977

Arto Salomaa, Magnus Steinby, 1977 .

Contextual Grammars: Erasing, Determinism, One-Side Contexts

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1993, Developments in Language Theory.

Factorizations of Languages and Commutativity Conditions

Arto Salomaa, Alexandru Mateescu, Sheng Yu, 2002, Acta Cybern..

Generation of Constants and Synchronization of Finite Automata

Arto Salomaa, A. Salomaa, 2002, J. Univers. Comput. Sci..

Computation and Automata: ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS

Arto Salomaa, 1985 .

X-Families: An Approach to the Study of Families of Syntactically Similar Languages

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1999 .

On m-adic Probabilistic Automata

Arto Salomaa, 1967, Inf. Control..

On the expressiveness of subset-sum representations

Lucian Ilie, Arto Salomaa, A. Salomaa, 2000, Acta Informatica.

Compositions over a Finite Domain: From Completeness to Synchronizable Automata

Arto Salomaa, A. Salomaa, 2001, A Half-Century of Automata Theory.

Finite Degrees of Ambiguity in Pattern Languages

Arto Salomaa, Alexandru Mateescu, 1994, RAIRO Theor. Informatics Appl..

Simple Splicing Systems

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1998, Discret. Appl. Math..

On the Injectivity of Parikh Matrix Mappings

Arto Salomaa, 2005, Fundam. Informaticae.

A sharpening of the Parikh mapping

Arto Salomaa, Alexandru Mateescu, Sheng Yu, 2001, RAIRO Theor. Informatics Appl..

Marcus Contextual Grammars: Modularity and Leftmost Derivation

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1994, Mathematical Aspects of Natural and Formal Languages.

Matrix Indicators For Subword Occurrences And Ambiguity

Arto Salomaa, Alexandru Mateescu, 2004, Int. J. Found. Comput. Sci..

Conjugate Words, Cuts of the Deck and Cryptographic Protocols

Arto Salomaa, 1997, Bull. EATCS.

Pattern Languages: Problems of Decidability and Generation

Arto Salomaa, 1993, FCT.

Networks of Language Processors: Parallel Communicating Systems

Erzsébet Csuhaj-Varjú, Arto Salomaa, E. Csuhaj-Varjú, 2001, Bull. EATCS.

Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems

Arto Salomaa, Azaria Paz, A. Paz, 1973, Inf. Control..

Parikh Matrices: Subword Indicators and Degrees of Ambiguity

Arto Salomaa, 2018, Adventures Between Lower Bounds and Higher Altitudes.

On Bases of Many-Valued Truth Functions

Arto Salomaa, 2018 .

Word, language, grammar

Grzegorz Rozenberg, Arto Salomaa, 1997 .

A Theorem Concerning the Composition of Functions of Several Variables Ranging Over a Finite Set

Arto Salomaa, 1960, J. Symb. Log..

Complementarity versus universality: Keynotes of DNA computing

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1998, Complex.

Cancellation and reassignment of votes in secret ballot elections

Arto Salomaa, Hannu Nurmi, 1993 .

Turquette A. R.. A general theory of k-place stroke functions in 2-valued logic. Proceedings of the American Mathematical Society , vol. 13 (1962), pp. 822–824.

Arto Salomaa, 1964 .

Context-Dependent L Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1979, Inf. Control..

DNA Complementarity and Paradigms of Computing

Arto Salomaa, 2002, COCOON.

Context-Free Grammar Forms with Strict Interpretations

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1980, J. Comput. Syst. Sci..

Membrane Computing

Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, 2014, Lecture Notes in Computer Science.

Formal Languages: an Introduction and a Synopsis

Arto Salomaa, Alexandru Mateescu, A. Salomaa, 1997, Handbook of Formal Languages.

Bibliography of L Systems

Martti Penttonen, Grzegorz Rozenberg, Arto Salomaa, 1977, Theor. Comput. Sci..

Growth Functions and Length Sets of Replicating Systems

Arto Salomaa, Valeria Mihalache, 1996, Acta Cybern..

The Generative Capacity of Transformational Grammars of Ginsburg and Partee

Arto Salomaa, 1971, Inf. Control..

Caesar and DNA. Views on Cryptology

Arto Salomaa, A. Salomaa, 1999, FCT.

Current Trends in Theoretical Computer Science - Essays and Tutorials

Grzegorz Rozenberg, Arto Salomaa, 1993, Current Trends in Theoretical Computer Science.

Teams in cooperating grammar systems

Gheorghe Paun, Lila Kari, Arto Salomaa, 1995, J. Exp. Theor. Artif. Intell..

On Predecessors of Finite Languages

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, Inf. Control..

From finite state grammars to natural computing - In memory of Solomon Marcus

Ion Petre, Gheorghe Paun, Grzegorz Rozenberg, 2017, Theor. Comput. Sci..

Theoretical Computer Science

Arto Salomaa, Lane A. Hemaspaandra, William I. Gasarch, 1999, Handbook of Discrete and Combinatorial Mathematics.

Characterization results about L codes

Juha Honkala, Arto Salomaa, A. Salomaa, 1992, RAIRO Theor. Informatics Appl..

Bounding the Indegree of Spiking Neural P Systems

Gheorghe Paun, Arto Salomaa, Mario de Jesús Pérez Jiménez, 2006 .

State complexity of basic language operations combined with reversal

Carlos Martín-Vide, Arto Salomaa, Guangwu Liu, 2008, Inf. Comput..

Automata, languages and programming : 15th International Colloquium, Tampere, Finland, July 11-15, 1988 : proceedings

Arto Salomaa, Timo Lepistö, 1988 .

Preface

Arto Salomaa, 1991, Discret. Appl. Math..

Systolic trellis automatat

Arto Salomaa, Jozef Gruska, Karel Culik, 1984 .

Developmental Languages Versus DNA Computing

Arto Salomaa, A. Salomaa, 2004 .

Simulation Algorithms for Computational Systems Biology

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2017, Texts in Theoretical Computer Science. An EATCS Series.

On strongly context-free languages

Lucian Ilie, Gheorghe Paun, Grzegorz Rozenberg, 2000, Discret. Appl. Math..

Formal Language Theory

Arto Salomaa, 1993, Current Trends in Theoretical Computer Science.

Lindenmayer and DNA: Watson-Crick D0L Systems

Arto Salomaa, Valeria Mihalache, 1997, Bull. EATCS.

On the Union of 0L Languages

Gheorghe Paun, Arto Salomaa, Jürgen Dassow, 1993, Inf. Process. Lett..

Simple Words in Equality Sets

Arto Salomaa, Marjo Lipponen, A. Salomaa, 2001, Bull. EATCS.

Jewels of formal language theory

Arto Salomaa, 1981 .

Revised Selected Papers of the 14th International Conference on Membrane Computing - Volume 8340

Artiom Alhazov, Marian Gheorghe, Svetlana Cojocaru, 2013 .

Decision Problems Resulting from Grammatical Inference

Arto Salomaa, Sheng Yu, Efim Kinber, 1987 .

Computation and Automata

Arto Salomaa, A. Salomaa, 1984 .

From Infinite to Finite by Identifying Variables in Many-Valued Logic

Arto Salomaa, 2018, J. Autom. Lang. Comb..

Membrane Computing

Grzegorz Rozenberg, Arto Salomaa, Claudio Zandron, 2015, Lecture Notes in Computer Science.

State Complexity of Basic Operations Combined with Reversal

Carlos Martín-Vide, Arto Salomaa, Guangwu Liu, 2007, LATA.

MSW Spaces

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1980, Inf. Control..

On the generative capacity of parallel communicating grammar systems

Arto Salomaa, Sorina Vicolov, Gheorghe P un, 1992 .

Proceedings of the 10th international conference on Membrane Computing

Grzegorz Rozenberg, Arto Salomaa, Gheorghe Păun, 2004 .

The Power of Networks of Watson-Crick D0L Systems

Erzsébet Csuhaj-Varjú, Arto Salomaa, E. Csuhaj-Varjú, 2004, Aspects of Molecular Computing.

DNA Computing: New Computing Paradigms

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1998 .

Computing by Splicing

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1996, Theor. Comput. Sci..

Power and size of extended Watson-Crick L systems

Erzsébet Csuhaj-Varjú, Arto Salomaa, Judit Csima, 2003, Theor. Comput. Sci..

Handbook of Formal Languages

Grzegorz Rozenberg, Arto Salomaa, G. Rozenberg, 1997, Springer Berlin Heidelberg.

Minimal Reaction Systems Defining Subset Functions

Arto Salomaa, 2014, Computing with New Resources.

Nonterminals, homomorphisms and codings in different variations of OL-systems

Sven Skyum, Grzegorz Rozenberg, Arto Salomaa, 2004, Acta Informatica.

The Oxford Handbook of Membrane Computing

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2010 .

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model

Arto Salomaa, Alexandru Mateescu, Sheng Yu, 1995, J. Univers. Comput. Sci..

Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers

Rudolf Freund, Grzegorz Rozenberg, Arto Salomaa, 2006, Workshop on Membrane Computing.

Views on Linguistics

Arto Salomaa, Alexandru Mateescu, 1996, Bull. EATCS.

Preface

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2011, Fundam. Informaticae.

Restricted use of the splicing operation

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1996, Int. J. Comput. Math..

DNA computing, sticker systems, and universality

Gheorghe Paun, Grzegorz Rozenberg, Lila Kari, 1998, Acta Informatica.

Two-Step Simulations of Reaction Systems by Minimal Ones

Arto Salomaa, 2015, Acta Cybern..

On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions

Arto Salomaa, A. Salomaa, 1986, Theor. Comput. Sci..

Bounded Delay L Codes

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1991, Theor. Comput. Sci..

Formal Language Theory Column - Two-way Thue

Arto Salomaa, 1987, Bull. EATCS.

Membrane Computing

Grzegorz Rozenberg, Arto Salomaa, Thomas Hinze, 2018, Lecture Notes in Computer Science.

Computation and Automata: Editor's Statement

Arto Salomaa, 1985 .

Membrane Computing

Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, 2017, Lecture Notes in Computer Science.

Semirings, Automata and Languages

Arto Salomaa, Werner Kuich, W. Kuich, 1985 .

Shuffle-like Operations on omega-words

Grzegorz Rozenberg, Arto Salomaa, Alexandru Mateescu, 1997, New Trends in Formal Languages.

Algorithmic Bioprocesses

Arto Salomaa, Joost N. Kok, Erik Winfree, 2009, Natural Computing Series.

A comparative overview ofcryptographic voting protocols

Arto Salomaa, Hannu Nurmi, 1998, Ann. Oper. Res..

Preface

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2017, Fundam. Informaticae.

A cryptographic approach to the secret ballot

Arto Salomaa, Hannu Nurmi, H. Nurmi, 1991 .

Pure interpretations for EOL forms

Derick Wood, Grzegorz Rozenberg, Hermann A. Maurer, 1979, RAIRO Theor. Informatics Appl..

Context-Free Grammars with Graph-Controlled Tables

Grzegorz Rozenberg, Arto Salomaa, 1976, J. Comput. Syst. Sci..

Membrane Computing, 5th International Workshop, WMC 2004, Milan, Italy, June 14-16, 2004, Revised Selected and Invited Papers

Giancarlo Mauri, Grzegorz Rozenberg, Arto Salomaa, 2005, Workshop on Membrane Computing.

On the Decidability of Homomorphism Equivalence for Languages

Arto Salomaa, Karel Culik, 1978, J. Comput. Syst. Sci..

On Well Quasi Orders of Free Monoids

Lucian Ilie, Arto Salomaa, A. Salomaa, 1998, Theor. Comput. Sci..

Journal of Universal Computer Science

Cristian S. Calude, Hermann A. Maurer, Arto Salomaa, 1994, J. Univers. Comput. Sci..

Some Remarks Concerning Many-Valued Propositional Logics

Arto Salomaa, A. Salomaa, 1974 .

Formal Languages and Power Series

Arto Salomaa, 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

Grzegorz Rozenberg: A Magical Scientist and Brother

Arto Salomaa, 2009, Algorithmic Bioprocesses.

Cornerstones of undecidability

Grzegorz Rozenberg, Arto Salomaa, G. Rozenberg, 1994, Prentice Hall International Series in Computer Science.

Decision Problems Concerning the Thinness of DOL Languages

Gheorghe Paun, Arto Salomaa, G. Paun, 1992, Bull. EATCS.

Preface of the special issue for Gheorghe Pǎun's 70th anniversary

Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, 2020, J. Membr. Comput..

Enjoying Natural Computing

Grzegorz Rozenberg, Arto Salomaa, Agustín Riscos-Núñez, 2018, Lecture Notes in Computer Science.

Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure

Gheorghe Paun, Arto Salomaa, Alexandru Mateescu, 1992, Acta Cybern..

Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism

Arto Salomaa, 2012, Theor. Comput. Sci..

Mirror Images and Schemes for the Maximal Complexity of Nondeterminism

Arto Salomaa, A. Salomaa, 2012, Fundam. Informaticae.

L Systems

Grzegorz Rozenberg, Lila Kari, Arto Salomaa, 1974, Handbook of Formal Languages.

A public-key cryptosystem based on language theory

Arto Salomaa, 1988, Comput. Secur..

What Emil said about the Post correspondance problem

Arto Salomaa, 1992, Bull. EATCS.

Watson-Crick D0L systems with regular triggers

Juha Honkala, Arto Salomaa, 2001, Theor. Comput. Sci..

Developments in Language Theory: 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001. Revised Papers

Grzegorz Rozenberg, Arto Salomaa, Werner Kuich, 2002 .

On Representing RE Languages by One-Sided Internal Contextual Languages

Gheorghe Paun, Andrzej Ehrenfeucht, Grzegorz Rozenberg, 1996, Acta Cybern..

Systolic automata for VLSI on balanced trees

Arto Salomaa, Jozef Gruska, Karel Culik, 2004, Acta Informatica.

Undecidable Problems Concerning Growth in Informationless Lindenmayer Systems

Arto Salomaa, 1976, J. Inf. Process. Cybern..

Sheng Yu (1950-2012) In Memoriam

Arto Salomaa, Kai Salomaa, Andrew L. Szilard, 2012, Fundam. Informaticae.

The mathematical theory of L systems

Grzegorz Rozenberg, Arto Salomaa, G. Rozenberg, 1980 .

Data structures and algorithms. Volume 1 : Sorting and searching

Kurt Mehlhorn, Grzegorz Rozenberg, Wilfried Brauer, 1984 .

DNA Computing: New Ideas and Paradigms

Grzegorz Rozenberg, Arto Salomaa, G. Rozenberg, 1999, ICALP.

Formale Sprachen

Arto Salomaa, 1978 .

Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes

Arto Salomaa, Alexandru Mateescu, A. Salomaa, 1993, MFCS.

Review: V. M. Gluskov, Some Problems of Synthesis of Digital Automata; V. M. Gluskov, On an Algorithm of Synthesis of Abstract Automata

Arto Salomaa, 1968 .

On Parallel Deletions Applied to a Word

Gheorghe Paun, Lila Kari, Arto Salomaa, 1995, RAIRO Theor. Informatics Appl..

Review: Michael A. Arbib, Theories of Abstract Automata

Arto Salomaa, 1972 .

Inclusion is Undecidable for Pattern Languages

Tao Jiang, Arto Salomaa, Sheng Yu, 1993, ICALP.

Ambiguity and Decision Problems Concerning Number Systems

Arto Salomaa, Karel Culik, 1983, ICALP.

Functional Constructions between reaction Systems and Propositional Logic

Arto Salomaa, A. Salomaa, 2013, Int. J. Found. Comput. Sci..

Semirings, Automata, Languages

Arto Salomaa, Werner Kuich, W. Kuich, 1985, EATCS Monographs on Theoretical Computer Science.

Sewing contexts and mildly context-sensitive languages

Carlos Martín-Vide, Arto Salomaa, Alexandru Mateescu, 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

Criteria for the matrix equivalence of words

Arto Salomaa, 2010, Theor. Comput. Sci..

Iterated Morphisms with Complementarity on the DNA Alphabet

Arto Salomaa, 2001, Words, Semigroups, and Transductions.

Pattern Grammars

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1996, J. Autom. Lang. Comb..

Three Constructions of Authentication/Secrecy Codes

Cunsheng Ding, Arto Salomaa, Patrick Solé, 2003, AAECC.

Grammars Based on the Shuffle Operation

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1995, J. Univers. Comput. Sci..

New Trends in Formal Languages

Arto Salomaa, Gheorghe Păun, G. Paun, 1997, Lecture Notes in Computer Science.

Shuffle on Trajectories: The Schützenberger Product and Related Operations

Tero Harju, Arto Salomaa, Alexandru Mateescu, 1998, MFCS.

L Codes and Number Systems

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1983, Theor. Comput. Sci..

Dense Hierarchies of Grammatical Families

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1982, JACM.

TWOPRIME: A Fast Stream Ciphering Algorithm

Cunsheng Ding, Valtteri Niemi, Arto Salomaa, 1997, FSE.

Denseness, maximality, and decidability of grammatical families

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1986 .

FINITE NON-DETERMINISTIC AND PROBABILISTIC AUTOMATA

Arto Salomaa, A. Salomaa, 1969 .

Introduction: DNA Computing in a Nutshell

Grzegorz Rozenberg, Arto Salomaa, Gheorghe Păun, 1998 .

Pattern languages with and without erasing

Arto Salomaa, Sheng Yu, Kai Salomaa, 1994 .

On the Crossover Distance

Victor Mitrana, Grzegorz Rozenberg, Arto Salomaa, 1998 .

The Nearly Perfect Auctioneer: Cryptographic Protocols for Auctions and Bidding

Arto Salomaa, Hannu Nurmi, 1994 .

MACROS, Iterated Substitution and Lindenmayer AFLs

Arto Salomaa, A. Salomaa, 1973 .

Linear modeling : background and application

Grzegorz Rozenberg, Arto Salomaa, 1997 .

Complementarity versus universality: Keynotes of DNA computing

Grzegorz Rozenberg, Arto Salomaa, Gheorghe Păun, 1998, Complex..

The Structure of the Monoid (N, X) of Logic Circuits.

Arto Salomaa, 1983 .

Generating Strings by Replication: A Simple Case

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 1996 .

Morphisms of free monoids and language theory

Arto Salomaa, 1979 .

Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002, Revised Papers

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 2002 .

Context-Free Grammars with Graph Controlled Tables

Grzegorz Rozenberg, Arto Salomaa, 1975 .

On essential variables of functions, especially in the algebra of logic

Arto Salomaa, A. Salomaa, 1964 .

Decision Questions Concerning Semilinearity Morphisms and

Tero Harju, Oscar H. Ibarra, Arto Salomaa, 2000 .

On symmetry in strings, sequences and languages

Arto Salomaa, Alexandru Mateescu, Gheorghe Păun, 1994 .

ALGEBRA OF REGULAR EXPRESSIONS

Arto Salomaa, 1969 .

On finite grammar forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1983 .

On basic groups for the set of functions over a finite domain

Arto Salomaa, 1964 .

DNA COMPUTING BASED ON THE SPLICING OPERATION

Gheorghe Paun, Arto Salomaa, 1996 .

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht

Grzegorz Rozenberg, Arto Salomaa, Jan Mycielski, 1997 .

Attempting to Define the Ambiguity of Internal contextual Languages

Carlos Martín-Vide, Arto Salomaa, Gheorghe Păun, 1998 .

On color-families of graphs

Arto Salomaa, A. Salomaa, 1981 .

Computation and Automata: Computational Complexity

Arto Salomaa, 1985 .

Membrane Computing - 12th International Conference, CMC 2011, Fontainebleau, France, August 23-26, 2011, Revised Selected Papers

Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, 2012 .

On an Extension of the Parikh Mapping

Arto Salomaa, Alexandru Mateescu, Sheng Yu, 2000 .

UPPER TRIANGULAR MATRICES AND SUBWORD OCCURRENCES

Arto Salomaa, 2009 .

Algebra, combinatorics, and logic in computer science

Gyula O. H. Katona, János Demetrovics, Arto Salomaa, 1986 .

DNA Computing, Matching Systems, and Universality

Gheorghe Paun, Grzegorz Rozenberg, Lila Kari, 1996 .

Computation and Automata: Turing Machines and Recursive Functions

Arto Salomaa, 1985 .

Nonterminals, Homomorphisms, and Codings in Different Variations of 0L-Systems

Sven Skyum, Grzegorz Rozenberg, Arto Salomaa, 1974 .