Abstract is missing.
- Complexity, Information, EnergyHelmut Jürgensen. 7-11
- The Descriptional Power of Sublogarithmic Resource Bounded Turing MachinesCarlo Mereghetti. 12-26
- Compact Descriptions for Efficient AlgorithmsMarkus E. Nebel. 27-40
- Wireless Parallel Computing and its Links to Descriptive ComplexityJirí Wiedermann, Dana Pardubská. 41-56
- Exact Generation of Minimal Acyclic Deterministic Finite AutomataMarco Almeida, Nelma Moreira, Rogério Reis. 57-68
- CD Grammar Systems with Regular Start ConditionsRudolf Freund, Marion Oswald. 69-80
- Optimal Simulations of Weak Restarting AutomataMartin Kutrib, Jens Reimann. 81-92
- Descriptional Complexity of Splicing SystemsRemco Loos, Andreas Malcher, Detlef Wotschke. 93-104
- Descriptional Complexities of Grammars over Alphabets with Finite ParametersTaishin Y. Nishida. 105-116
- A Regularity Condition for Context-Free GrammarsBeatrice Palano. 117-128
- Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion SystemsGheorghe Paun, Mario J. Pérez-Jiménez, Takashi Yokomori. 129-140
- Remarks on Context-Free Parallel Communicating Grammar Systems Generating Crossed AgreementsBianca Truthe. 141-152
- A New Measure of Descriptional Complexity of Languages and Formal Power Series: CompactnessKostyantyn Archangelsky. 153-161
- Nonterminal Complexity of Some Operations on Context-Free LanguagesJürgen Dassow, Ralf Stiebe. 162-169
- Descriptional Complexity of Generalized Forbidding GrammarsTomás Masopust, Alexander Meduna. 170-177
- Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost ParsesAlexander Meduna, Jirí Techet. 178-185