Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID60. Birthday: Arto Salomaa, 1994
- Juhani Karhumäki, Hermann A. Maurer, Grzegorz Rozenberg:
Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10-11, 1994, Proceedings. Lecture Notes in Computer Science 812, Springer 1994, ISBN 3-540-58131-6
- Nils Andersen, Neil D. Jones:
Generalizing Cook's Transformation to Imperative Stack Programs. 1-18 - Jean Berstel:
A Rewriting of Fife's Theorem about Overlap-Free Words. 19-29 - Wilfried Brauer, Ute Brauer:
Reconsidering the Jeep Problem - Or How to Transport a Birthday Present to Salosauna. 30-33 - Anne Brüggemann-Klein, Petra Fischer, Thomas Ottmann:
Learning Picture Sets from Examples. 34-43 - Cristian Calude, Helmut Jürgensen:
Randomness as an Invariant for Number Representations. 44-66 - Erzsébet Csuhaj-Varjú:
Cooperating Grammars' Systems: Power and Parameters. 67-84 - Karel Culík II, Jarkko Kari:
Parallel Pattern Generation with One-Way Communications. 85-96 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Dynamic Labeled 2-Structures with Variable Domains. 97-123 - Joost Engelfriet:
Deciding the NTS Property of Context-Free Grammars. 124-130 - Ferenc Gécseg:
Homomorphic Representations by Producs of Tree Automata. 131-139 - Tero Harju, Hendrik Jan Hoogeboom, H. C. M. Kleijn:
Identities and Transductions. 140-144 - Tero Harju, Grzegorz Rozenberg:
Decompostion of Infinite Labeled 2-Structures. 145-158 - Juha Honkala:
An Iteratio Property of Lindenmayerioan Power Series. 159-168 - Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö:
Comparing Descriptional and Computational Complexity of Infinite Words. 169-182 - Oscar H. Ibarra, Tao Jiang:
On Some Open Problems Concerning the Complexity of Cellular Arrays. 183-196 - Lila Kari:
Power of Controlled Insertion and Deletion. 197-212 - Alica Kelemenová, Jozef Kelemen:
From Colonies to Eco(grammar)systems. 213-231 - Werner Kuich:
On the Multiplicity Equivalence Problem for Context-free Grammars. 232-250 - G. S. Makanin, Habib Abdulrab:
On General Solution of Word Equations. 251-263 - Alexandru Mateescu:
On (Left) Partial Shuffle. 264-278 - Hermann A. Maurer:
Learning Theoretical Aspects is Important but (Sometimes) Dangerous. 279-288 - Mogens Nielsen, Christian Clausen:
Bisimulation, Games, and Logic. 289-306 - Valtteri Niemi, Ari Renvall:
Cryptographic Protocols and Voting. 307-317 - Hannu Nurmi:
Cryptographic Protocols for Auctions and Bargaining. 317-324 - Gheorghe Paun, Jürgen Dassow, Stefan Skalla:
On the Size of Components of Cooperating Grammar Systems. 325-343 - Azaria Paz:
An Elementary Algorithmic Problem from an Advanced Standpoint. 344-357 - Keijo Ruohonen:
Event Detection for ODEs and Nonrecursive Hierarchies. 358-371 - Kai Salomaa, Derick Wood, Sheng Yu:
Rediscovering Pushdown Machines. 372-385 - Imre Simon:
String Matching Algorithms and Automata. 386-395 - Magnus Steinby:
Classifying Regular Languages by their Syntactic Algebras. 396-409 - Paavo Turakainen:
On Polynomial Matrix Equations X T = p(X) and X = p(X). Where all Parameters are Nonnegative. 410-421 - Emo Welzl:
Gram's Equation - A Probabilistic Proof. 422-424
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-10-03 00:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
