sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:000000012146796X | 1 hits
Person
ISNI: 
0000 0001 2146 796X
Name: 
Arto Salomaa
Arto Salomaa (finnischer Informatiker)
Arto Salomaa (Finnish mathematician and computer scientist)
Arto Salomaa (Fins wiskundige)
Salomaa, A.
Salomaa, Arto
Salomaa, Arto K.
Salomaa, Arto Kustaa
サローマ, A
Dates: 
1934-
Creation class: 
article
Computer file
Language material
Text
txt
Creation role: 
author
editor
redactor
Related names: 
Culik, Karel (1934-)
Gheorghe, Marian
Kuich, Werner (1941-...)
Mateescu, Alexandru
Păun, Gheorghe
Păun, Gheorghe (1950-...)
Rozenberg, G. (1934-)
Rozenberg, Grzegorz
Rozenberg, Grzegorz (1934-)
Soittola, Matti (1945-)
Steinby, Magnus
University of Waterloo. Faculty of Mathematics
足立, 暁生 (1936-)
Titles: 
2-testability and relabelings produce every[t]hing
2-Testability and relabelings produce everything
Algebra, combinatorics, and logic in computer science
Ambiguity and decision problems concerning number systems.
Attempting to Define the Ambiguity of Internal Contextual Languages
Automata-theoretic aspects of formal power series
Book of L, c1986:, The
Characterization of poly-slender context-free languages
Chinese remainder theorem applications in computing, coding, cryptography
Colorings and Interpretations: A Connection Between Graphs and Grammar Forms
Comparing Subword Occurrences in Binary D0L Sequences
Completeness of Context-Free Grammar Forms
Composition sequences for functions over a finite domain
Computability paradigms based on DNA complementarity
Computation and automata
Computing by splicing
Connections between subwords and certain matrix mappings
Context-free evolutionary grammars and the structural language of nucleic acids.
Cornerstones of undecidability
Cryptographic Approach to the Secret Ballot, A
Decidability and Density in Two-Symbol Grammar Forms
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 and natural computing : honoring the 80th birthday of Andrzej Ehrenfeucht
Formal languages
Formale Sprachen
From Watson-Crick L systems to Darwinian P systems.
Grammatical models of multi-agent systems
Information and randomness an algorithmic perspective
Introduction à l'informatique théorique calculabilité et complexité
Keisanron to ōtomaton riron
Kōkai kagi angōkei
Kriptografiâ s otkrytym klûčom
Language-theoretic aspects of string replication
Lindenmayer systems : impacts on theoretical computer science, computer graphics, and developmental biology
mathematical theory of L systems
MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
Membrane computing : 14th International Conference, CMC 2013, Chişinău, Republic of Moldova, August 20-23, 2013 : revised selected papers
Multiset Processing Mathematical,Computer Science, and Molecular Computing Points of View
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 Some Problems of Mateescu Concerning Subword Occurrences
On the crossover distance
On the decomposition of finite languages
On the heights of closed sets of operations in finite algebras
Operations and language generating devices suggested by the genome evolution
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
Public-Key Cryptosystem Based on Language Theory, A
Restricted use of the splicing operation
Results and trends in theoretical computer science : colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994 : proceedings
Secret Ballot Elections in Computer Networks
Secret Sharing Schemes with Nice Access Structures
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
SPIKING NEURAL P SYSTEMS: AN EARLY SURVEY
Structures in logic and computer science a selection of essays in honor of A. Ehrenfeucht
Subword Balance in BinaryWords, Languages and Sequences
Supernormal-Form Theorem for Context-Free Grammars, A
Syntactic monoids in the construction of systolic tree automata.
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
Tietokonevaalit ja Tengvallin credo
Time-Dependent Scheduling
Topics in the theory of DNA computing
Two Complete Axiom Systems for the Algebra of Regular Events
Uni-transitional Watson-Crick D0L systems
VLSI Systolic trees as acceptors
Watson-Crick D0L systems: the power of one transition
Watson-Crick D0L systems with regular triggers
Watson-Crick walks and roads on DOL graphs
X-Families: An Approach to the Study of Families of Syntactically Similar Languages
Žemčužiny teorii formal'nyh âzykov
計算論とオートマトン理論
Contributed to or performed: 
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Notes: 
Sources: 
VIAF DNB LAC LC NDL NKC NLP NUKAT SELIBR SUDOC WKD
BOWKER
NTA
ZETO