Journal of Automata, Languages and Combinatorics, Volume 1

Volume 1, Number 1, 1996

Peter J. Grabner, Helmut Prodinger: On the Optimality of an Algorithm of Reingold and Supowit. 5-12 BibTeX
Lila Kari, Gabriel Thierrin: Omega-Syntactic Congruences. 13-26 BibTeX
Gheorghe Paun: Regular Extended H Systems are Computationally Universal. 27-36 BibTeX
Kai Salomaa: On the Modularity of Decidability of Completeness and Termination. 37-54 BibTeX
Dietmar Wätjen: Regulations of Uniformly k-Limited ET0L Systems and Their Relations to Controlled Context-Free Grammars. 55-80 BibTeX

Igor Baník: Colonies as Systems of Turing Machines Without States. 81-96 BibTeX
Henning Bordihn, Henning Fernau: Accepting Grammars and Systems via Context Condition Grammars. 97-112 BibTeX
James D. Currie, Robert O. Shelton: Cantor Sets and Dejean's Conjecture. 113-128 BibTeX
Peter Hartmann: Implementation of Parallel Replacement Systems for Cellular Hypergraphs. 129-146 BibTeX
Joanna Jedrzejowicz: Undecidability Results for Shuffle Languages. 147-164 BibTeX

Symeon Bozapalidis: Convex Algebras, Convex Modules and Formal Power Series on Trees. 165-180 BibTeX
Gianina Georgescu: On the Regularity of Languages Generated by Parallel Communicating Grammar Systems. 181-198 BibTeX
Jonathan S. Golan, Alexandru Mateescu, Dragos Vaida: Semirings and Parallel Composition of Processes. 199-218 BibTeX
Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Pattern Grammars. 219-242 BibTeX

Henning Fernau: Membership for k-Limited ET0L Languages Is Not Decidable. 243-246 BibTeX
Silvia Ghilezan: Generalized Finitness of Developments in Typed Lambda Calculi. 247-258 BibTeX
Rainer Kemp: On Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership Problem. 259-304 BibTeX
Victor Mitrana: Iterated Pattern Languages. 305- BibTeX