Abstract is missing.
- A Grammatical Approach to the LBA ProblemHenning Bordihn. 1-9
- Conditional Context-Free Languages of Finite IndexHenning Fernau, Markus Holzer. 10-26
- On the Number of Nonterminals in Matrix Grammars with Leftmost DerivationsAlexander Meduna. 27-38
- The Accepting Power of Finite Automata over GroupsVictor Mitrana, Ralf Stiebe. 39-48
- Controlled Fuzzy Parallel RewritingPeter R. J. Asveld. 49-70
- On Controlling Rewriting by Properties of Strings and SymbolsPaolo Bottoni, Giancarlo Mauri, Piero Mussio. 71-94
- Accepting Array Grammars with Control MechanismsHenning Fernau, Rudolf Freund. 95-118
- On Restarting Automata with RewritingPetr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel. 119-136
- Deterministic Cooperating Distributed Grammar SystemsValeria Mihalache, Victor Mitrana. 137-149
- Grammar Systems with Counting Derivation and Dynamical PrioritiesTudor Balanescu, Horia Georgescu, Marian Gheorghe. 150-166
- Characterization of RE Using CD Grammar Systems with Two Registers and RL RulesSorina Dumitrescu. 167-177
- On Cooperating Distributed Uniformly Limited 0L SystemsDietmar Wätjen. 178-196
- Teams in Grammar Systems: Sub-Context-Free CasesMaurice H. ter Beek. 197-216
- A Note on the Incomparability of the EOL Family with Certain Families of Languages Generated by Cooperating Grammar SystemsMohamed Amin. 217-219
- Colonies as Models of Reactive SystemsJozef Kelemen. 220-235
- Grammatical Inference of ColoniesPetr Sosík, Leos Stýbnar. 236-246
- A Grammar Characterization of Logarithmic-Space ComputationKarl R. Abrahamson, Liming Cai, Steve Gordon. 247-255
- On the Computational Complexity of Context-Free Parallel Communicating Grammar SystemsStefan D. Bruda. 256-266
- Parallel Communicating Grammar Systems with Communication by SignalsDaniel Popescu. 267-277
- PC Grammar Systems Versus Some Non-Context-Free Constructions from Natural and Artificial LanguagesAdrian Chitu. 278-287
- Grammar Systems for the Description of Certain Natural Language FactsMaria Dolores Jiménez-López, Carlos Martín-Vide. 288-298
- Networks of Parallel Language ProcessorsErzsébet Csuhaj-Varjú, Arto Salomaa. 299-318
- A Reduced Distributed Splicing System for RE LanguagesClaudio Zandron, Claudio Ferretti, Giancarlo Mauri. 319-329
- On the Generative Capacity of Splicing Grammar SystemsGianina Georgescu. 330-345
- Array Splicing SystemsKamala Krithivasan, Venkatesan T. Chakaravarthy, Raghavan Rama. 346-365
- Two Lower Bounds on Computational Complexity of Infinite WordsJuraj Hromkovic, Juhani Karhumäki. 366-376
- On omega-power LanguagesLudwig Staiger. 377-394
- Shuffle-like Operations on omega-wordsAlexandru Mateescu, George Daniel Mateescu, Grzegorz Rozenberg, Arto Salomaa. 395-411
- Generalized Lindenmayerian Algebraic SystemsWerner Kuich. 412-421
- The Structure of the Basic MorphismsVirgil Emil Cazanescu. 422-429
- On Mix OperationManfred Kudlek, Alexandru Mateescu. 430-439
- On the Complexity of Iterated InsertionsMarkus Holzer, Klaus-Jörn Lange. 440-453
- The Decidability of the Generalized Confluence Problem for Context-Free LanguagesLucian Ilie. 454-464