
Arto Salomaa
1934 – 2025
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. Source: https://en.wikipedia.org/wiki/Arto_Salomaa
Books
- Studies in honour of Arto Kustaa Salomaa on the occasion of his fiftieth birthday, June 6, 1984
- J.UCS The Journal of Universal Computer Science
- DNA computing
- Results and trends in theoretical computer science
- J. UCS
- Membrane Computing
- Introduction à l'informatique théorique
- On sequences of functions over an arbitrary domain
- On the reducibility of events represented in automata
- On the basic groups for the set of functions over a finite domain
- On probabilistic automata with one input letter
- Theorems on the representation of events in Moore-automata
- On basic groups for the set of functions over a finite domain
- On some families of formal languages obtained by regulated derivations
- On the heights of closed sets of operations in finite algebras
- Multiset Processing
- Developments in language theory II
- Jewels are forever
- On the composition of functions of several variables ranging over a finite set
- On the number of simple bases of the set of functions over a finite domain
- On infinitely generated sets of operations in finite algebras
- On essential variables of functions, especially in the algebra of logic
- Žemčužiny teorii formal'nyh jazykov
- Current trends in theoretical computer science
- Public-Key Cryptography
- Some completeness criteria for sets of functions over a finite domain
- Some completencess criteria for sets of functions over a finite domain
- On a homomorphic characterization of recursively enumerable languages
- Proceedings of the second Finnish Summer School on Theoretical Computer Science
- Automata, Languages and Programming
- A half-century of automata theory
- Axiom systems for regular expressions of finite automata
- Lindenmayer Systems
- The Book of L
- Automata-Theoretic Aspects of Formal Power Series
- L systems
- On finite time-variant automata with monitors of different types
- On grammars with restricted use of productions
- Computation and Automata
- Enjoying Natural Computing
- Algebra, combinatorics, and logic in computer science
Author data: Open Library