Abstract is missing.
- Succinctness in Quantum Information ProcessingJozef Gruska. 15-25
- On the Descriptional Complexity of Finite Automata With Modified Acceptance ConditionsMarkus Holzer. 26-41
- Descriptional Complexity of Eco-Grammar SystemsAlica Kelemenová. 42-52
- Some Complexity Aspects of Hybrid Networks of Evolutionary ProcessorsVictor Mitrana. 53-65
- Descriptional Complexity Issues in Membrane ComputingGheorghe Paun. 66-77
- On the Number of Components in Cooperating Distributed Grammar SystemsHenning Bordihn. 81-89
- Random DFAs over a Non-Unary AlphabetJean-Marc Champarnaud, Thomas Paranthoën. 90-101
- Reducing the Number of Catalysts Needed in Computationally Universal P Systems without PrioritiesRudolf Freund, Marion Oswald, Petr Sosík. 102-113
- State Complexity of Some Operations on Regular LanguagesGalina Jirásková. 114-125
- Succinct Representations of Languages by DFA With Different Levels of ReliabilityMartin Kappes, Frank Nießner. 126-137
- On the Descriptional Power of Heads, Counters, and PebblesMartin Kutrib. 138-149
- Descriptional Complexity of Rewriting Tissue P SystemsKuppuswamy Lakshmanan, Raghavan Rama. 150-161
- On Two-Way Communication in Cellular Automata With a Fixed Number of CellsAndreas Malcher. 162-173
- Complementing Unary Nondeterministic AutomataFilippo Mera, Giovanni Pighizzini. 174-185
- Positive Valence GrammarsRalf Stiebe. 186-197
- On the Descriptional Complexity of External Hybrid Cooperating Distributed Grammar SystemsBettina Sunckel. 198-209
- On the Number of Conditional Productions in Simple Semi-conditional GrammarsGyörgy Vaszil. 210-220
- A Frontier Result on Enhanced Time-Varying Distributed H Systems with Parallel ComputationsSergey Verlan. 221-232
- Template-Guided DNA RecombinationMark Daley, Ian McQuillan. 235-244
- Some Remarks on Primitive Words and PalindromesPál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura. 245-254
- Proper Dependency GrammarsRadu Gramatovici, Martin Plátek. 255-264
- Context-Free Insertion-Deletion SystemsMaurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan. 265-273
- On the Number of Nonterminals in Linear Conjunctive GrammarsAlexander Okhotin. 274-283
- A Polynomial Complexity Class in P Systems Using Membrane DivisionMario J. Pérez-Jiménez, Álvaro Romero Jiménez, Fernando Sancho-Caparrini. 284-294
- Complexity Results for Prefix GrammarsHolger Petersen. 295-302
- Restarting Automata and Variants of j-MonotonicityMartin Plátek, Friedrich Otto, Frantisek Mráz. 303-312