Salomaa, Arto
Salomaa, Arto, 1934-
Salomaa, A. (Arto), 1934-
Salomaa, A.
Arto Salomaa
VIAF ID: 108122679 (Personal)
Permalink: http://viaf.org/viaf/108122679
Preferred Forms
-
100 0 _ ‡a Arto Salomaa
-
200 _ | ‡a Salomaa ‡b Arto ‡f 1934-....
-
100 1 _ ‡a Salomaa, A.
-
-
100 1 _ ‡a Salomaa, Arto
-
-
-
-
100 1 _ ‡a Salomaa, Arto
-
100 1 _ ‡a Salomaa, Arto
-
-
100 1 _ ‡a Salomaa, Arto
-
-
-
100 1 _ ‡a Salomaa, Arto ‡d 1934-
-
100 1 _ ‡a Salomaa, Arto, ‡d 1934-
-
4xx's: Alternate Name Forms (17)
5xx's: Related Names (2)
Works
Title | Sources |
---|---|
2-testability and relabelings produce every[t]hing |
![]() |
Algebra, combinatorics, and logic in computer science |
![]() ![]() ![]() ![]() ![]() ![]() |
Ambiguity and decision problems concerning number systems |
![]() |
Automata-theoretic aspects of formal power series |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
The Book of L, c1986: |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Chinese remainder theorem applications in computing, coding, cryptography |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Computation and automata |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Cornerstones of undecidability |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Developments in language theory two |
![]() ![]() ![]() ![]() ![]() |
DNA computing : new computing paradigms |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
European Association for Theoretical Computer Science monographs on theoretical computer science |
![]() |
Formal and Natural Computing : Essays Dedicated to Grzegorz Rozenberg |
![]() |
Formal languages |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Formale Sprachen |
![]() ![]() |
Grammatical models of multi-agent systems |
![]() ![]() ![]() |
Information and randomness an algorithmic perspective |
![]() ![]() ![]() |
Introduction à l'informatique théorique calculabilité et complexité |
![]() ![]() |
Jewels of formal language theory |
![]() |
Keisanron to ōtomaton riron |
![]() |
Kōkai kagi angōkei |
![]() |
Kriptografiâ s otkrytym klûčom |
![]() |
Lindenmayer systems : impacts on theoretical computer science, computer graphics, and developmental biology |
![]() ![]() ![]() ![]() |
mathematical theory of L systems |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Membrane computing : 14th International Conference, CMC 2013, Chişinău, Republic of Moldova, August 20-23, 2013 : revised selected papers |
![]() ![]() |
Membrane computing with external output |
![]() |
Multidisciplinary creativity : homage to Gheorghe Păun on his 65th birthday |
![]() |
On a homomorphic characterization of recursively enumerable languages |
![]() ![]() ![]() ![]() |
On cooperatively distributed ciphering and hashing |
![]() |
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 infinite words obtained by iterating morphisms |
![]() |
On probabilistic automata with one input letter |
![]() |
On sequensis of functions over an arbitrary domain |
![]() |
On the crossover distance |
![]() |
On the heights of closed sets of operations in finite algebras |
![]() |
Oxford handbook of membrane computing |
![]() ![]() ![]() ![]() ![]() |
Parallel composition of words with re-entrant symbols |
![]() |
Pattern languages versus parallel communicating grammar systems |
![]() |
Primality of types of instances of the post correspondence problem |
![]() |
Public-key cryptography |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Results and trends in theoretical computer science : colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994 : proceedings |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Semirings, automata, 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 |
![]() |
Some completeness criteria for sets of functions over a finite domain |
![]() |
Structures in logic and computer science a selection of essays in honor of A. Ehrenfeucht |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Systolic automata for VLSI on balanced trees |
![]() |
Systolic trellis automata : stability, decidability and complexity |
![]() |
Texts theor. comput. sci. (Print) |
![]() |
Theory is forever essays dedicated to Arto Salomaa on the occasion of his 70th birthday |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
VLSI Systolic trees as acceptors |
![]() |
Žemčužiny teorii formal'nyh âzykov |
![]() ![]() |
公開鍵暗号系 |
![]() ![]() |
計算論とオートマトン理論 |
![]() ![]() |