Salomaa, Arto

name

• Salomaa, Arto

Authored works

• Automata-theoretic aspects of formal power series
• Axiom systems for regular expressions of finite automata
• Composition sequences for functions over a finite domain
• Compositions over a finite domain : from completeness to synchronizable automata
• Computation and automata
• Connections between subwords and certain matrix mappings
• Counting (scattered) subwords
• Developmental languages versus DNA computing
• DNA complementarity and paradigms of computing
• Formal languages
• Formale Sprachen
• Independence of certain quantities indicating subword occurrences
• Introduction à l'informatique théorique : calculabilité & complexité
• Iterated morphisms with complementarity on the DNA alphabet
• Jewels of formal language theory
• On a homomorphic characterization of recursively enumerable languages
• On basic groups for the set of functions over a finite domain
• On essential variables of functions, especially in the algebra of logic
• On finite time-variant automata with monitors of different types
• On grammars with restricted use of productions
• On infinitely generated sets of operations in finite algebras
• On languages defined by numerical parameters
• On probabilistic automata with one input letter
• On sequences of functions over an arbitrary domain
• On some families of formal languages obtained by regulated derivations
• On the basic groups for the set of functions over a finite domain
• On the composition of functions of several variables ranging over a finite set
• On the heights of closed sets of operations in finite algebras
• On the number of simple bases of the set of functions over a finite domain
• On the reducibility of events represented in automata
• On the state complexity of reversals of regular languages
• Public-key cryptography
• Some completencess criteria for sets of functions over a finite domain : 1
• Some completeness criteria for sets of functions over a finite domain : 2
• Subword balance in binary words, languages and sequences
• Subword conditions and subword histories
• Synchronization of finite automata : contributions to an old problem
• Theorems on the representation of events in Moore-automata
• Theory of automata
• Uni-transitional Watson-Crick D0L systems
• Watson-Crick D0L systems : the power of one transition
• Watson-Crick walks and roads on DOL graphs
• Žemčužiny teorii formal'nyh jazykov

Works contributed to

• 2-testability and relabelings produce every[t]hing
• A magician in science : liber amicorum Grzegorz Rozenberg
• A note on slender 0L languages
• An inequality for occurences of subwords
• Automata, languages and programming : fourth colloquium, University of Turku, Finland, July 18-22, 1977
• Bounding the indegree of spiking neural P systems
• Characterizations of recursively enumerable languages by usigng copy languages
• Chomsky-Schutzenberger-type representations of poly-slender context-free languages
• Cornerstones of undecidability
• From DNA recombination to DNA computing via formal languages
• Growth functions and length sets of replicating systems
• L systems
• Language-theoretic aspects of DNA complementarity
• Many-valyed truth functions, Ĉerný's conjecture and road coloring
• Matrix indicators for subword occurrences and ambiguity
• Membrane computing with external output
• Networks of Watson-Crick D0L systems
• On cooperatively distributed ciphering and hashing
• On some problems of Mateescu concerning subword occurrences
• On strongly context-free languages
• On the crossover distance
• On the decomposition of finite languages
• Parallel composition of words with re-entrant symbols
• Pattern languages versus parallel communicating grammar systems
• Power and size of extended Watson-Crick L systems
• Proceedings of the second Finnish Summer School on Theoretical Computer Science : Parainen, Finland, August 26-29, 1985
• Secret sharing schemes with nice access structures
• Sewing contexts and mildly context-sensitive languages
• Shuffle on trajectories : a simplified approach to the Schützenberger product and related operations
• Shuffle on trajectories : syntactic constraints
• Simple words in equality sets
• Slender context-free languages are strongly linear
• Subword histories and Parikh matrices
• The book of L
• The mathematical theory of L systems
• The power of networks of Watson Crick D0L systems
• The very knowledge of coding : studies in honor of Aimo Tietäväinen on the occasion of his fiftieth birthday July 6, 1987
• Totuus ja arvo : filosofinen tutkimus
• Watson-Crick DOL systems

Works about Salomaa, Arto

• Arto Salomaa : äijän näköinen matemaatikko
• Studies in honour of Arto Kustaa Salomaa on the occasion of his fiftieth birthday, June 6, 1984