Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automata, Languages and Combinatorics, Volume 5
Volume 5, Number 1, 2000
- Jozef Kelemen, Alica Kelemenová:
Grammar Systems: Where are we? And Where do we go from Here? (As an Editorial). 5-12 - Rudolf Freund:
Array Grammar Systems. 13-29 - Ján Gaso:
Unreliable Colonies - the Sequential Case. 31-44 - Petr Sosík:
On the Decidability Problems of Eco-Grammar Systems. 45-58 - György Vaszil:
Further Remarks on Parallel Communicating Grammar Systems without a Master. 59-75
Volume 5, Number 2, 2000
- Raymond R. Devillers, Hanna Klaudel, Elisabeth Pelz:
An Algebraic Box Calculus. 81-107 - Zoltán Ésik, Werner Kuich:
A Kleene Theorem for Lindenmayerian Algebraic Power Series. 109-122 - Juha Honkala:
On Formal Power Series Generated by Lindenmayer Systems. 123-144 - Alexandru Mateescu, Kai Salomaa, Sheng Yu:
On Fairness of Many-Dimensional Trajectories. 145-157 - Dietmar Wätjen:
Undecidability Results for Uniformly k-Limited 0L Systems. 159-167
Volume 5, Number 3, 2000
- Jürgen Dassow, Detlef Wotschke:
Editorial. 173
- Erzsébet Csuhaj-Varjú:
Parallel Communicating Grammar Systems with Bounded Resources: Results, Techniques, Open Problems. 175-190 - Jozef Gruska:
Descriptional Complexity Issues in Quantum Computing. 191-218 - Kosaburo Hashiguchi, Shin Ichihara, Shuji Jimbo:
Formal Languages over Free Binoids. 219-234 - Hing Leung:
On a Family of Nondeterministic Finite Automata. 235-244 - Holger Petersen:
Prefix Rewriting and Descriptional Complexity. 245-254 - Jeffrey O. Shallit:
Automaticity and Rationality. 255-268
- Martin Kappes:
Descriptional Complexity of Deterministic Finite Automata with Multiple Initial States. 269-278 - Carlos Martín-Vide, Alexandru Mateescu:
Special Families of Sewing Languages. 279-286 - Carlo Mereghetti, Giovanni Pighizzini:
Two-Way Automata Simulations and Unary Languages. 287-300 - Victor Mitrana:
On the Degree of Communication in Parallel Communicating Finite Automata Systems. 301-314 - Andrei Paun:
On the Diameter of Various Classes of H Systems. 315-324 - Heinz Schmitz:
Restricted Temporal Logic and Deterministic Languages. 325-341 - José M. Sempere:
On a Class of Regular-like Expressions for Linear Languages. 343-354 - Yuri Velinov:
Regions of Influence in Simple Decomposition Forms of Finite Functions. 355-366
Volume 5, Number 4, 2000
- Christian Choffrut, Massimiliano Goldwurm:
Timed Automata with Periodic Clock Constraints. 371-403 - Friedrich Otto:
On Dehn Functions of Finitely Presented Bi-Automatic Monoids. 405-419 - Ivo G. Rosenberg, Dietmar Schweigert:
Locally Maximal Clones II. 421-455 - Lakshminarayanan Subramanian, Muralidhar Talupur, Kamala Krithivasan, C. Pandu Rangan:
On the Generative Power of Simple H Systems. 457-473
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 2024-04-22 20:02 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:
