Abstract is missing.
- Some formal methods for analyzing quantum automataAlberto Bertoni, Carlo Mereghetti, Beatrice Palano. 1-14
- Using Abstract State Machines for the Description and the Analysis of Formal SystemsEgon Börger. 15-22
- (Non)determinism and the Size of One-Way Finite AutomataViliam Geffert. 23-37
- Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language TheoryJuraj Hromkovic, Georg Schnitger. 38-38
- The Kolmogorov complexity of infinite objectsLudwig Staiger. 39-50
- The degree of parallelismHenning Bordihn, Henning Fernau. 51-62
- On active symbols in CD grammar systemsHenning Bordihn, Bettina Sunckel. 63-74
- Large NFA Without Mergeable StatesCezar Câmpeanu, Nicolae Santean, Sheng Yu. 75-84
- Enumeration of Context-Free Languages and Related StructuresMichael Domaratzki, Alexander Okhotin, Jeffrey Shallit. 85-96
- Two-way non-deterministic finite automata with a write-once track recognize regular languages onlyBerke Durak. 97-109
- Refining the Nonterminal Complexity of Graph-controlled GrammarsHenning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt. 110-121
- Learning Unary AutomataGregor Gramlich, Ralf Herrmann. 122-133
- Multidimensional Descriptional Complexity of P SystemsMiguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez. 134-145
- Simple-Regular Expressions and LanguagesYo-Sub Han, Gerhard Trippen, Derick Wood. 146-157
- Descriptional Complexity of Deterministic Restarting AutomataMarkus Holzer, Martin Kutrib, Jens Reimann. 158-169
- Union and Intersection of Regular Languages and Descriptional ComplexityMarek Hricko, Galina Jirásková, Alexander Szabari. 170-181
- State complexity of cyclic shiftGalina Jirásková, Alexander Okhotin. 182-193
- Deterministic moles cannot solve livenessChristos A. Kapoutsis. 194-205
- On Weight of Universal Insertion GrammarsLila Kari, Petr Sosík. 206-214
- On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown AutomataAndreas Malcher. 215-226
- Non-returning PC Grammar Systems Generate Any Recursively Enumerable Language with Eight Context-free ComponentsGyörgy Vaszil. 227-235
- Synchronization Functions of Synchronized Context-Free Grammars and LanguagesFranziska Biegler. 236-244
- On the descriptional complexity of soliton automataMiklós Krész. 245-252
- Incompatible Measures of Internal Contextual GrammarsKuppuswamy Lakshmanan. 253-260
- Remarks on Multiple Entry Deterministic Finite AutomataLibor Polák. 261-268
- On the Representation of Finite AutomataRogério Reis, Nelma Moreira, Marco Almeida. 269-276
- A note on the descriptional complexity of CD grammar systems of finite indexBettina Sunckel. 277-284
- On minimal context-free insertion-deletion systemsSergey Verlan. 285-292