Arto Salomaa

Q: What Schools Are Affiliated With Arto Salomaa

Arto Salomaa is affiliated with the following schools: University of Turku, Leiden University, University of Helsinki, University of Western Ontario, Aarhus University, University of California, Berkeley

Arto Salomaa's AcademicInfluence.com Rankings

Arto Salomaa

Computer Science

#1337

World Rank

#1382

Historical Rank

computer-science Degrees

Arto Salomaa

Mathematics

#2641

World Rank

#4045

Historical Rank

Measure Theory

#329

World Rank

#498

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Arto Salomaa's Degrees

PhD Mathematics University of Helsinki

Why Is Arto Salomaa Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Arto K. Salomaa is a Finnish mathematician and computer scientist. His research career, which spans over forty years, is focused on formal languages and automata theory. Early life and education Salomaa was born in Turku, Finland on June 6, 1934. He earned a Bachelor's degree from the University of Turku in 1954 and a PhD from the same university in 1960. Salomaa's father was a professor of philosophy at the University of Turku. Salomaa was introduced to the theory of automata and formal languages during seminars at Berkeley given by John Myhill in 1957.

(See a Problem?)

Arto Salomaa's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Handbook of Formal Languages (1997) (1632)
Formal languages (1973) (1004)
The mathematical theory of L systems (1980) (957)
The Oxford Handbook of Membrane Computing (2010) (872)
Public-Key Cryptography (1991) (871)
Automata-Theoretic Aspects of Formal Power Series (1978) (826)
DNA Computing: New Computing Paradigms (1998) (781)
Semirings, Automata, Languages (1985) (558)
Developments in Language Theory II (2002) (495)
Chinese remainder theorem: applications in computing, coding, cryptography (1996) (388)
Two Complete Axiom Systems for the Algebra of Regular Events (1966) (318)
Jewels of formal language theory (1981) (293)
Semirings, Automata and Languages (1985) (251)
Theory Of Automata (1969) (222)
The Book of L (1986) (188)
Handbook of formal languages, vol. 3: beyond words (1997) (165)
Dna Computing: New Computing Paradigms (Texts In Theoretical Computer Science. An Eatcs Series) (1998) (163)
Handbook of formal languages, vol. 1: word, language, grammar (1997) (154)
Computation and Automata (1984) (141)
A sharpening of the Parikh mapping (2001) (125)
Secret ballot elections in computer networks (1991) (125)
DNA computing, sticker systems, and universality (1998) (120)
Shuffle on Trajectories: Syntactic Constraints (1998) (111)
Probabilistic and Weighted Grammars (1969) (109)
Computing by Splicing (1996) (109)
Networks of Parallel Language Processors (1997) (103)
Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009. Revised Selected and Invited Papers (2010) (102)
Regular expression (2003) (97)
On the state complexity of reversals of regular languages (2004) (96)
Thin and Slender Languages (1995) (95)
Cornerstones of undecidability (1994) (92)
Current Trends in Theoretical Computer Science: The Challenge of the New Century (2004) (89)
State complexity of combined operations (2007) (88)
Watson-Crick finite automata (1997) (88)
Grammars with Controlled Derivations (1997) (86)
Decision Problems for Patterns (1995) (86)
L Systems (1974) (83)
Subword histories and Parikh matrices (2004) (83)
Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology (2001) (81)
Introduction: DNA Computing in a Nutshell (1998) (77)
Topics in the theory of DNA computing (2002) (76)
Systolic trellis automatat (1984) (75)
Formal Languages: an Introduction and a Synopsis (1997) (72)
Membrane Computing with External Output (2000) (70)
Aspects of Classical Language Theory (1997) (69)
New Trends in Formal Languages (1997) (68)
On the Decidability of Homomorphism Equivalence for Languages (1978) (67)
Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems (1973) (65)
Simple Splicing Systems (1998) (64)
Journal of Universal Computer Science (1994) (63)
Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View (2000) (62)
Some Decision Problems Concerning Semilinearity and Commutation (2002) (60)
On essential variables of functions, especially in the algebra of logic (1964) (60)
On the decomposition of finite languages (1998) (59)
Formal and Natural Computing (2002) (59)
Matrix Indicators For Subword Occurrences And Ambiguity (2004) (58)
Algorithmic Bioprocesses (2009) (58)
On the Index of a Context-Free Grammar and Language (1969) (57)
Pattern languages with and without erasing (1994) (56)
Connections between subwords and certain matrix mappings (2005) (55)
Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring (1999) (54)
DNA Computing (1998) (54)
Grammatical Models of Multi-Agent Systems (1999) (54)
Equality sets for homomorphisms of free monoids (1978) (54)
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht (1997) (50)
Functions and sequences generated by reaction systems (2012) (50)
Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model (1995) (49)
Language-theoretic problems arising from Richelieu cryptosystems (1993) (49)
Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars (1998) (46)
Structures in Logic and Computer Science (1997) (45)
Algebraic Systems and Pushdown Automata (2009) (43)
Public-Key Cryptography (1996) (42)
On the Injectivity of Parikh Matrix Mappings (2004) (41)
Operations and language generating devices suggested by the genome evolution (2002) (40)
Counting (scattered) Subwords (2003) (40)
On Infinite Words Obtained by Iterating Morphisms (1982) (40)
Periodically Time-Variant Context-Free Grammars (1970) (40)
Colorings and interpretations: a connection between graphs and grammar forms (1981) (39)
Criteria for the matrix equivalence of words (2010) (38)
On exponential growth in Lindenmayer systems (1973) (38)
State complexity of basic language operations combined with reversal (2008) (38)
Systolic Tree Acceptors (1984) (37)
Pure Grammars (1980) (37)
Systolic Trellis Automata: Stability, Decidability and Complexity (1986) (37)
DNA COMPUTING BASED ON THE SPLICING OPERATION (1996) (37)
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa (1999) (36)
Matrix Grammars with a Leftmost Restriction (1972) (35)
Inclusion is Undecidable for Pattern Languages (1993) (35)
Composition sequences for functions over a finite domain (2003) (35)
Test Sets and Checking Words for Homomorphism Equivalence (1980) (33)
Functional Constructions between reaction Systems and Propositional Logic (2013) (32)
Secret Selling of Secrets with Several Buyers (1990) (32)
Minimal and almost minimal reaction systems (2013) (32)
Handbook of formal languages, vol. 2: linear modeling: background and application (1997) (32)
A theorem concerning the composition of functions of several variables ranging over a finite set (1960) (31)
On State Sequences Defined by Reaction Systems (2012) (31)
Independence of certain quantities indicating subword occurrences (2006) (31)
Cryptographic protocols for Vickrey auctions (1993) (30)
Finite Degrees of Ambiguity in Pattern Languages (1994) (29)
Parallelism in Rewriting Systems (1974) (29)
Teams in cooperating grammar systems (1995) (28)
Cartesian authentication codes from functions with optimal nonlinearity (2003) (27)
On Some Problems of Mateescu Concerning Subword Occurrences (2006) (27)
On a Family of L Languages Resulting from Systolic Tree Automata (1983) (27)
Algebra, combinatorics, and logic in computer science (1986) (27)
Data structures and algorithms. Volume 1 : Sorting and searching (1984) (27)
The Ehrenfeucht conjecture: a proof for language theorists (1985) (26)
Language-theoretic aspects of DNA complematarity (2001) (26)
Verifying and Recasting Secret Ballots in Computer Networks (1991) (26)
DNA Computing: New Ideas and Paradigms (1999) (26)
On Finite Automata with a Time-Variant Structure (1968) (26)
Factorizations of Languages and Commutativity Conditions (2002) (25)
Current Trends in Theoretical Computer Science, Entering the 21th Century (2001) (25)
Lindenmayer and DNA: Watson-Crick D0L Systems (2001) (25)
Grammars Based on Patterns (1993) (25)
Ambiguity and Decision Problems Concerning Number Systems (1983) (25)
A homomorphic characterization of regular languages (1982) (25)
L Codes and Number Systems (1983) (24)
Bidirectional sticker systems. (1998) (23)
A characterization of poly-slender context-free languages (2000) (23)
Contextual Grammars: Erasing, Determinism, One-Side Contexts (1993) (23)
Word, language, grammar (1997) (23)
Context-free evolutionary grammars and the structural language of nucleic acids. (1997) (23)
Watson-Crick Walks and Roads on DOL Graphs (1998) (23)
Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers (2006) (23)
Secret Sharing Schemes with Nice Access Structures (2006) (22)
MACROS, Iterated Substitution and Lindenmayer AFLs (1973) (22)
Closure Properties of Slender Languages (1993) (22)
Developmental Systems with Fragmentation (1974) (22)
Uniform Interpretations of L Forms (1978) (22)
Return to Patterns (1995) (22)
On basic groups for the set of functions over a finite domain (1964) (22)
Context-Free Grammar Forms with Strict Interpretations (1980) (21)
Subword conditions and subword histories (2006) (21)
Review: S. V. Ablonskij, Functional Constructions in k-Valued Logic (1964) (21)
Subword Occurrences, Parikh Matrices and Lyndon Images (2010) (21)
ICALP'88: Proceedings of the 15th International Colloquium on Automata, Languages and Programming (1988) (21)
On Good E0L Forms (1978) (20)
On m-adic Probabilistic Automata (1967) (19)
Complementarity versus universality: Keynotes of DNA computing (1998) (19)
Watson-Crick D0L systems with regular triggers (2001) (19)
Turing, Watson-Crick and Lindenmayer. Aspects of DNA Complementarity (1997) (19)
Contextual Grammars: Parallelism and Blocking of Derivation (1996) (19)
On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions (1986) (19)
Marcus Contextual Grammars: Modularity and Leftmost Derivation (1994) (19)
Slender 0L Languages (1996) (19)
Morphisms of free monoids and language theory (1979) (18)
Algorithmically Coding the Universe (1993) (18)
Multi-Pattern Languages (1995) (18)
On an Extension of the Parikh Mapping (2000) (18)
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002] (2002) (18)
Decision Problems Concerning the Thinness of DOL Languages (1992) (18)
Dense Hierarchies of Grammatical Families (1982) (17)
Formal Languages and Power Series (1991) (17)
Generation of Constants and Synchronization of Finite Automata (2002) (17)
Subword histories and associated matrices (2008) (17)
Undecidability of the State Complexity of Composed Regular Operations (2011) (17)
Current Trends in Theoretical Computer Science - Essays and Tutorials (1993) (17)
Uni-transitional Watson-Crick D0L systems (2002) (16)
Deletion Sets (1993) (16)
Ambiguity, Nondeterminism and State Complexity of Finite Automata (2017) (16)
The Generative Capacity of Transformational Grammars of Ginsburg and Partee (1971) (16)
Rainbow of Computer Science - Dedicated to Hermann Maurer on the Occasion of His 70th Birthday (2011) (16)
Networks of Watson-Crick D0L Systems (2003) (16)
On the existence of prime decompositions (2007) (16)
On Languages Defined by Numerical Parameters (2007) (16)
Three Constructions of Authentication/Secrecy Codes (2003) (16)
Membrane Computing - 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009) (15)
Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002, Revised Papers (2002) (15)
ALGEBRA OF REGULAR EXPRESSIONS (1969) (15)
On Parallel Deletions Applied to a Word (1995) (14)
A Supernormal-Form Theorem for Context-Free Grammars (1983) (14)
Power and size of extended Watson-Crick L systems (2003) (14)
Computing by splicing: programmed and evolving splicing systems (1997) (13)
Restricted use of the splicing operation (1996) (13)
Spiking Neural P Systems: an Early Survey (2007) (13)
Linear modeling : background and application (1997) (13)
Two-Step Simulations of Reaction Systems by Minimal Ones (2015) (13)
A cryptographic approach to the secret ballot (1991) (12)
Growth Functions of Lindenmayer Systems: Some New Approaches (1975) (12)
Preface [to WMC 2003 - 4th International Workshop on Membrane Computing, Revised selected papers] (2004) (12)
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages (2001) (12)
Completeness of Context-Free Grammar Forms (1981) (12)
On the Form Equivalence of L-Forms (1977) (12)
On Well Quasi Orders of Free Monoids (1998) (12)
Conditional Tabled Eco-Grammar Systems (1995) (12)
Applications of the Chinese remainder theorem to reaction systems with duration (2015) (12)
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday) (1997) (11)
Solution of a decision problem concerning unary Lindenmayer systems (1974) (11)
Pattern Systems (1996) (11)
Membrane Computing : 11th International Conference, CMC 2010, Jena, Germany, August 24-27, 2010. Revised Selected Papers (2011) (11)
The Formal Language Theory Column (1987) (11)
Decidability and density in two-symbol grammar forms (1981) (10)
When L was Young (1986) (10)
On strongly context-free languages (1998) (10)
Watson-Crick D0L systems: the power of one transition (2003) (10)
Compositions over a Finite Domain: From Completeness to Synchronizable Automata (2001) (10)
On the generative capacity of parallel communicating grammar systems (1992) (10)
Minimal Reaction Systems Defining Subset Functions (2014) (10)
On finite grammar forms (1983) (10)
Computation and Automata: ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS (1985) (10)
Lindenmayer Systems (1992) (9)
Shuffle on Trajectories: The Schützenberger Product and Related Operations (1998) (9)
Variants of codes and indecomposable languages (2009) (9)
Computational Matter (2018) (9)
Iterated Morphisms with Complementarity on the DNA Alphabet (2001) (9)
Systolic automata for VLSI on balanced trees (2004) (9)
A public-key cryptosystem based on language theory (1988) (9)
PCP-Prime Words and Primality Types (1993) (9)
State Complexity of Basic Operations Combined with Reversal (2012) (9)
On Representing RE Languages by One-Sided Internal Contextual Languages (1996) (9)
On some recent problems concerning developmental languages (1973) (9)
Context-Free Grammars with Graph-Controlled Tables (1976) (9)
Iteration Grammars and Lindenmayer AFL's (1974) (9)
On Predecessors of Finite Languages (1981) (8)
Subword Balance in BinaryWords, Languages and Sequences (2007) (8)
Parallel Composition of Words with Re-entrant Symbols (1996) (8)
Grammars Based on the Shuffle Operation (1995) (8)
The Power of Restricted Splicing with Rules from a Regular Language (1996) (8)
Conducting secret ballot elections in computer networks: Problems and solutions (1994) (8)
Subword balance, position indices and power sums (2010) (8)
TWOPRIME: A Fast Stream Ciphering Algorithm (1997) (7)
Comparing Subword Occurrences in Binary D0L Sequences (2007) (7)
Computability Paradigms Based OnDNA Complementarity (1970) (7)
The Universe is Lawless or “Pantôn chrêmatôn metron anthrôpon einai” (2012) (7)
Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms (1978) (7)
Relative Goodness for EOL Forms (1978) (7)
From DNA Recombination to DNA Computing, Via Formal Languages (1996) (7)
Developments in Language Theory II, At the Crossroads of Mathematics, Computer Science and Biology, Magdeburg, Germany, 17-21 July 1995 (1996) (7)
Length Codes, Products of Languages and Primality (2008) (7)
Bounded Delay L Codes (1991) (7)
On color-families of graphs (1981) (7)
Bounding the Indegree of Spiking Neural P Systems (2006) (7)
A Half-Century of Automata Theory: Celebration and Inspiration (2001) (7)
Cryptography and Data Security (1988) (7)
2-Testability and Relabelings Produce Everything (1998) (7)
Secret ballot elections and public-key cryptosystems (1992) (6)
On Events Represented by Probabilistic Automata of Different Types (1968) (6)
Primary Types of Instances of the Post Correspondence Problem (1991) (6)
Networks of Language Processors: Parallel Communicating Systems (2001) (6)
Pattern Languages Versus Parallel Communicating Grammar Systems (1997) (6)
Sub-Regular Grammar Forms (1981) (6)
Contexts on trajectories (1998) (6)
Insertion-Deletion Systems (1998) (6)
Algorithms and Programs (2005) (6)
Introduction to Formal Language Theory (1998) (6)
Undecidability of state complexity (2013) (6)
Compositions of Reaction Systems (2014) (6)
Parikh Prime Words and GO-like Territories (1995) (6)
Parikh Matrices: Subword Indicators and Degrees of Ambiguity (2018) (6)
On sentential forms of context-free grammars (1973) (6)
On the Union of 0L Languages (1993) (6)
The Structure of the Monoid (N, X) of Logic Circuits. (1983) (6)
Nondeterministic Trajectories (2002) (6)
Synchronized E0L Forms (1980) (6)
Pure interpretations for EOL forms (1979) (6)
Simple Reductions Between D0L Language and Sequence Equivalence Problems (1993) (6)
From Watson-Crick L systems to Darwinian P systems (2003) (5)
Nonterminals, homomorphisms and codings in different variations of OL-systems (1974) (5)
Membrane Computing, 5th International Workshop, WMC 2004, Milan, Italy, June 14-16, 2004, Revised Selected and Invited Papers (2005) (5)
Shuffle-like Operations on omega-words (1997) (5)
Nondeterminism in Patterns (1994) (5)
Membrane Computing - 12th International Conference, CMC 2011, Fontainebleau, France, August 23-26, 2011, Revised Selected Papers (2012) (5)
Generating Strings by Replication: A Simple Case (1996) (5)
Characteristic Words for Parikh Matrices (2009) (5)
Depth of Functional Compositions (2004) (5)
FINITE NON-DETERMINISTIC AND PROBABILISTIC AUTOMATA (1969) (5)
Conditional Tabled Eco-Grammar Systems versus (E)TOL Systems (1996) (5)
Minimal reaction systems: Duration and blips (2017) (5)
Attempting to Define the Ambiguity of Internal contextual Languages (1998) (5)
Synchronized EOL Forms Under Uniform Interpretation (1981) (5)
Families Generated by Grammars and L Systems (1997) (5)
EOL forms (1977) (4)
Self-Reading Sequences (1996) (4)
Synchronization of Finite Automata: Contributions to an Old Problem (2002) (4)
On symmetry in strings, sequences and languages (1994) (4)
DNA Computing, Matching Systems, and Universality (1996) (4)
Bibliography of L Systems (1977) (4)
Context-Dependent L Forms (1979) (4)
Developments in Language Theory, At the Crossroads of Mathematics, Computer Science and Biology, Turku, Finland, 12-15 July 1993 (1994) (4)
L Morphisms: Bounded Delay and Regularity of Ambiguity (1991) (4)
Sewing contexts and mildly context-sensitive languages (2001) (4)
Nonterminals, homomorphisms and codings in different variations of OL-systems (2004) (4)
Review: Michael A. Arbib, Theories of Abstract Automata (1972) (4)
Power from Power Series (1979) (4)
Denseness, maximality, and decidability of grammatical families (1986) (4)
L Codes and L Systems with Immigration (1991) (3)
Computation and Automata: Turing Machines and Recursive Functions (1985) (3)
Revised Papers from the International Workshop on Membrane Computing (2002) (3)
Theoretical Computer Science (1999) (3)
Computation and Automata: Computational Complexity (1985) (3)
P, NP and the Post Correspondence Problem (1995) (3)
On a homomorphic characterization of recursively enumerable languages (1973) (3)
Membrane Computing (2014) (3)
Membrane Computing - 17th International Conference, CMC 2016, Milan, Italy, July 25-29, 2016, Revised Selected Papers (2017) (3)
UPPER TRIANGULAR MATRICES AND SUBWORD OCCURRENCES (2009) (3)
A Deterministic Algorithm for Modular Knapsack Problems (1991) (3)
DNA Complementarity and Paradigms of Computing (2002) (3)
Proceedings of the 10th international conference on Membrane Computing (2004) (3)
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism (2012) (3)
Context-Free Grammars with Graph Controlled Tables (1975) (3)
The Secret Number: An Exposition of Chaitin's Theory (2007) (3)
L-Systems: A Device in Biologically Motivated Automata Theory (1973) (3)
Enjoying Natural Computing (2018) (3)
Cancellation and reassignment of votes in secret ballot elections (1993) (3)
Preface [to WMC 5 – 5th Int. Workshop on Membrane Computing, Selected papers] (2005) (3)
Membrane Computing (2015) (2)
Computation and Automata: Editor's Statement (1985) (2)
A new Cryptosystem based on Formal Language Theory (2002) (2)
Pattern Languages: Problems of Decidability and Generation (1993) (2)
Geometric Transformations on Language Families: The Power of Symmetry (1997) (2)
On slender 0L languages (2000) (2)
Characterization results about L codes (1992) (2)
Membrane Computing (2017) (2)
DNA: Its Structure and Processing (1998) (2)
Decision Questions Concerning Semilinearity Morphisms and (2000) (2)
On generators and generative capacity of EOL forms (2004) (2)
Introduction and Philosophy (1996) (2)
Uniform Interpretations of Grammar Forms (1981) (2)
Grammatical Families (1980) (2)
On Regular Characterizations of Languages by Grammar Systems (1996) (2)
Syntactic and Semantic Aspects of Parallelism (1997) (2)
Language-theoretic aspects of string replication (1998) (2)
The Power of Networks of Watson-Crick D0L Systems (2004) (2)
Recent Results on L Systems (1976) (2)
Beginnings of Molecular Computing (1998) (2)
Caesar and DNA. Views on Cryptology (1999) (2)
A Pumping Result for 2-Context-Free Languages (1988) (2)
Membrane Computing: 7th International Workshop, WMC 2006, Leiden, Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers (Lecture Notes in Computer Science) (2007) (2)
Undecidable Problems Concerning Growth in Informationless Lindenmayer Systems (1976) (2)
Decision problems arising from knapsack transformations (1990) (2)
X-Families: An Approach to the Study of Families of Syntactically Similar Languages (1999) (2)
On space-bounded synchronized alternating Turing machines* (1992) (2)
Syntactic monoids in the construction of systolic tree automata (1985) (1)
The Idea of Public Keys (1996) (1)
On the expressiveness of subset-sum representations (2000) (1)
In the prehistory of formal language theory: Gauss Languages (1992) (1)
Derivation languages of grammar forms (1981) (1)
MSW Spaces (1980) (1)
Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012 (2013) (1)
Growth Functions and Length Sets of Replicating Systems (1996) (1)
New squeezing mechanisms for L systems (1977) (1)
ETOL Forms (1978) (1)
On the equivalence of grammars inferred from derivation (1986) (1)
Power Sums Associated with Certain Recursive Procedures on Words (2011) (1)
Membrane Computing (2003) (1)
Sheng Yu (1950-2012) In Memoriam (2012) (1)
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism (2012) (1)
From Parikh vectors to GO territories (1995) (1)
In the Prehistory of Formal Languages : Gauss Languages ? (2019) (1)
Computability paradigms based on (1997) (1)
What Emil said about the Post correspondance problem (1992) (1)
The Nearly Perfect Auctioneer: Cryptographic Protocols for Auctions and Bidding (1994) (1)
Sheng Yu (2012) (1)
On the Crossover Distance (1998) (1)
Review: Robert E. Clay, A Simple Proof of Functional Completeness in Many-Valued Logics Based on Lukasiewicz's C and N; Robert E. Clay, Note on Slupecki T-Functions (1965) (1)
Undecidability of State Complexities Using Mirror Images (2012) (1)
Characterizations of re languages starting from internal contextual languages (1998) (1)
On regular expressions and regular canonical systems (1968) (1)
Generalised DOL Trees (1995) (1)
Some Remarks Concerning Many-Valued Propositional Logics (1974) (1)
Formal Power Series and Growth Functions of Lindenmayer Systems (1975) (1)
Formal Language Theory Column - Two-way Thue (1987) (1)
Characterizations of RE Languages by Means of Insertion Grammars (1996) (1)
Automata, languages and programming : fourth colloquium, University of Turku, Finland, July 18-22, 1977 (1977) (1)
Conjugate Words, Cuts of the Deck and Cryptographic Protocols (1997) (1)
Handbook of formal languages. background and application (1997) (1)
Developments in Language Theory: 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001. Revised Papers (2002) (1)
Table systems with unconditional transfer (1981) (1)
In Memoriam Sheng Yu (1950-2012) (2012) (1)
Proceedings of the Fourth Colloquium on Automata, Languages and Programming (1977) (1)
Decidability in finite automata (1990) (1)
Cryptographic Protocols: Surprising Vistas for Communication (1990) (1)
Formal Language Theory (1993) (0)
In Coding Theory (1996) (0)
SYNCHRONIZED EOL FORMS * (2001) (0)
Applications of rational series (1978) (0)
Automata, languages and programming : 15th International Colloquium, Tampere, Finland, July 11-15, 1988 : proceedings (1988) (0)
A HOMOMORPHIC CHARACTERIZATION OF REGULAR LANGUAGES Karel CULIK II (2001) (0)
Preface (2012) (0)
The B-Machine (2005) (0)
In Bridging Computations (1996) (0)
ICALP, EATCS and Maurice Nivat (2002) (0)
On Cooperatively Distributed Ciphering and Hashing (1996) (0)
Computation and Automata: Restricted Automata (1985) (0)
Universality by Finite H Systems (1998) (0)
Salomaa Arto. Some analogues of Sheffet functions in infinite-valued logics. Proceedings of a Colloquium on Modal and Many-valued Logics, Helsinki, 23–26 August, 1962, Acta philosophica Fennica, no. 16, Helsinki 1963, pp. 227–235. (1966) (0)
On Some Biologically Motivated Control Devices for Parallel Rewriting (2011) (0)
Ordered Catenation Closures and Decompositions of Languages Related to a Language of Derick Wood (2010) (0)
Simple Words in Equality Sets (2001) (0)
Review: K. Jaakko, J. Hintikka, On the Logical Study of Language (1963) (0)
A comparative overview ofcryptographic voting protocols (1998) (0)
JSL volume 33 issue 1 Cover and Front matter (1968) (0)
Review: A. V. Gladkij, O raspoznavanii zaméščaémosti v rékursivnyh ázykah; A. V. Gladkij, M. Greendlinger, On the Recognition of Replaceability in Recursive Languages (1970) (0)
On Bases of Many-Valued Truth Functions (2018) (0)
Computation and Automata: Rudiments of Language Theory (1985) (0)
Revised Selected Papers of the 14th International Conference on Membrane Computing - Volume 8340 (2013) (0)
Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes (1993) (0)
Uni-transitional Watson-crick D0l Systems Uni-transitional Watson-crick D0l Systems (2001) (0)
Preface (2012) (0)
Classical Two-Way Cryptography (1996) (0)
SYSTOUC TREE ACCEPTORS ( * ) (2017) (0)
A note on slender 0L languages (1997) (0)
Interpreted Head-Order Graph Reduction (2005) (0)
Computation and Automata: Trends in Automata and Language Theory (1985) (0)
Seventy Years Derick Wood (2010) (0)
JSL volume 33 issue 2 Cover and Front matter (1968) (0)
Clay Robert E.. A standard form for Łukasiewicz many-valued logics. Notre Dame journal of formal logic, vol. 4 (1963), pp. 59–66. (1965) (0)
Introduction: Models of Computation (1985) (0)
Review: O. P. Kuznecov, On a Class of Regular Events (1968) (0)
Denning Peter J., Dennis Jack B., and Qualitz Joseph E.. Machines, languages, and computation. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1978, xxii + 601 pp. (1980) (0)
Computation and Automata: Historical and Bibliographical Remarks (1985) (0)
Grammars Based on the Shuue Operation (1995) (0)
Review: Akira Nakamura, On the Infinitely Many-Valued Double-Threshold Logic (1966) (0)
JSL volume 34 issue 2 Cover and Front matter (1969) (0)
From finite state grammars to natural computing - In memory of Solomon Marcus (2017) (0)
5th International Workshop on Membrane Computing (2005) (0)
Review: V. M. Gluskov, Some Problems of Synthesis of Digital Automata; V. M. Gluskov, On an Algorithm of Synthesis of Abstract Automata (1968) (0)
On non context-free grammar forms (1978) (0)
Public-Key Cryptosystems and Language Theory (1989) (0)
Algebraic series and context-free languages (1978) (0)
Splicing Circular Strings (1998) (0)
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. (1964) (0)
Views on Linguistics (1996) (0)
On simplest possible solutions for Post Correspondence Problems (1993) (0)
On Axiomatizations of General Many-Valued Propositional Calculi (2014) (0)
JSL volume 34 issue 1 Cover and Front matter (1969) (0)
Review: Raili Kauppi, Intension and Extension of Concepts (1963) (0)
Other Bases of Cryptosystems (1996) (0)
FINITE DETERMINISTIC AUTOMATA (1969) (0)
Semi-Commutativity Sets of Morphisms over Finitely Generated Free Monoids 1 (2010) (0)
The se(m)cd Machine and Others (2005) (0)
Computation and Automata: Cryptography (1985) (0)
Algorithmic Language (2020) (0)
On meta-normal forms for algebraic power series in noncommuting variables (1985) (0)
Descriptional Complexity of Finite Automata - Selected Highlights (2023) (0)
Patterns (1994) (0)
Arbib Michael A.. Theories of abstract automata. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1969, xiii + 412 pp. (1972) (0)
Chomsky-Schutzenberger-Type Representations of Poly-Slender Context-Free Languages (1999) (0)
Gramars with Oracles (1993) (0)
Membrane Computing (2018) (0)
Synchronization of Nite Automata. Contributions to an Old Problem Synchronization of Nite Automata. Contributions to an Old Problem (2007) (0)
Preface (1991) (0)
On some Decidability Problems Concerning Developmental Languages (1975) (0)
Another Functional Abstract Machine (2005) (0)
A fascinating rainbow of computation - Honoring Gheorghe Păun on the occasion of his 70th birthday (2021) (0)
JSL volume 33 issue 4 Cover and Front matter (1969) (0)
Grzegorz Rozenberg: A Magical Scientist and Brother (2009) (0)
Toward Full-Fledged λ-Calculus Machines (2005) (0)
Abstract Computing Machines (2005) (0)
Research in Information and Communication Technology in Norwegian Universities and Colleges - A review (2002) (0)
Real Computing Machines (2005) (0)
L Systems, Most of the papers were presented at a conference in Aarhus, Denmark, January 14-25, 1974 (1974) (0)
JSL volume 33 issue 3 Cover and Front matter (1968) (0)
Parikh Prime Words and Go-like Territories 1 (0)
In Modular Computations (1996) (0)
Famous Decision Problems (1985) (0)
The π-red Machinery (2005) (0)
Wilfried Brauer (1937-2014) in memoriam (2014) (0)
Preface of the special issue for Gheorghe Pǎun’s 70th anniversary (2020) (0)
Minor complexity of discrete functions (2020) (0)
Finitary and infinitary interpretations of languages (1981) (0)
FORMAL LANGUAGES AND GENERALIZED AUTOMATA (1969) (0)
Review: Seymour Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages (1976) (0)
Many aspects of formal languages (1991) (0)
Developmental Languages Versus DNA Computing (2004) (0)
On the Number of Simple Bases of Boolean Functions.On Superpositions of Functions in P k.Investigation of some Classes of Functions in Multivalued Logics.On some Properties of Essential Functions from P k (1966) (0)
Revised Papers from the 5th International Conference on Developments in Language Theory (2001) (0)
Theories of Abstract Automata, Michael A. Arbib. Prentice-Hall, Providence, RI (1969), xiii + 412 pp. (1971) (0)
Minimal and almost minimal reaction systems (2013) (0)
The λ-Calculus (2005) (0)
From Infinite to Finite by Identifying Variables in Many-Valued Logic (2018) (0)
Distributed H Systems (1998) (0)
[New ideas from school days]. (1967) (0)
Depth of Closed Classes of Truth Functions in Many-Valued Logic (2017) (0)
Algebraic Representations of Regular Array Languages (2000) (0)
Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude) (2023) (0)
Decision Problems Resulting from Grammatical Inference (1987) (0)
Generalized DOL trees * (2010) (0)
Characterizations of Recursively Enumerable Languages by Using Copy Languages (1997) (0)
ON COLOR.FAMILIES OF GRAPI{S (0)
Chinese Remainder Algorithm (1996) (0)
The complexity of matrix transposition on one-tape off-line Turing machines with output tape* (1993) (0)
Preface (2011) (0)
Review: William H. Jobe, Functional Completeness and Canonical Forms in Many-valued Logics (1964) (0)
Imperative Abstract Machines (2005) (0)
The G-Machine (2005) (0)
Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure (1992) (0)
Review: Robert E. Clay, A Standard Form for Lukasiewicz Many-Valued Logics (1965) (0)
Composition Sequences and Synchronizing Automata (2012) (0)

This paper list is powered by the following services:

Other Resources About Arto Salomaa

What Schools Are Affiliated With Arto Salomaa?

Arto Salomaa is affiliated with the following schools:

Arto Salomaa's Academic­Influence.com Rankings

Arto Salomaa's Degrees

Why Is Arto Salomaa Influential?

Arto Salomaa's Published Works

Published Works

Other Resources About Arto Salomaa

What Schools Are Affiliated With Arto Salomaa?

Image Attributions

Arto Salomaa's AcademicInfluence.com Rankings