Abstract is missing.
- Descriptional Complexity Issues in Grammar SystemsErzsébet Csuhaj-Varjú. 13-16
- Regular Expressions: New Results and Open ProblemsKeith Ellul, Jeffrey Shallit, Ming-wei Wang. 17-34
- The Separation Problems and Descriptional ComplexityJuris Hartmanis. 35
- Repetition Complexity of WordsLucian Ilie, Sheng Yu, Kaizhong Zhang. 36
- On Possible Extensions and Relationships Between Software Reliability, Software Metrics and Descriptional ComplexityMartin Kappes. 37-39
- Complexity Issues in Binding-Blocking AutomataM. Sakthi Balan. 43-54
- Economy of Descriptions for Basic Constructions on Rational TransductionsHenning Bordihn, Markus Holzer, Martin Kutrib. 55-69
- How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to l?Cezar Câmpeanu. 70-80
- NFAs bitstream-based random generationJean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi. 81-94
- State Complexity of Shuffle on TrajectoriesMichael Domaratzki, Kai Salomaa. 95-109
- Efficient Simulation of Nondeterministic Weighted Finite AutomataMark G. Eramian. 110-122
- NP Predicates Computable in the Weakest Level of the Grzegorczyck HierarchyCristian Grozea. 123-132
- Descriptional Complexity of Error/Edit SystemsLila Kari, Stavros Konstantinidis. 133-147
- Complexity Issues in Rewriting P SystemsMadhu Mutyam. 148-159
- On One-Way Cellular Automata with a Fixed Number of CellsAndreas Malcher. 160-173
- Efficient Computation of Regular Expressions from Unary NFAsAndrew Martinez. 174-187
- Descriptional Complexity of Block-Synchronization Context-Free GrammarsIan McQuillan. 188-203
- Context Derivation Sets and Context-Free Normal FormsCharlotte L. Miller. 204-215
- Probabilistic Parsing StrategiesMark-Jan Nederhof, Giorgio Satta. 216-230
- Büchi automata and their degrees of nondeterminism and ambiguityFrank Nießner. 231-245
- Descriptional complexities of grammars over alphabets with finite parametersTaishin Y. Nishida. 246-255
- State complexity of linear conjunctive languagesAlexander Okhotin. 256-270