Volume 12,
Number 1-2,
2007
Selected Papers of the 7th Workshop on Descriptional Complexity of Formal Systems (Como,
Italy,
June 30 - July 2,
2005)
- Franziska Biegler:
Synchronization Functions of Synchronized Context-Free Grammars and Languages.
7-24 BibTeX
- Henning Bordihn, Henning Fernau:
The Degree of Parallelism.
25-47 BibTeX
- Henning Bordihn, Bettina Sunckel:
On Active Symbols in CD Grammar Systems.
49-67 BibTeX
- Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
A Family of NFAs Free of State Reductions.
69-78 BibTeX
- Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit:
Enumeration of Context-Free Languages and Related Structures.
79-95 BibTeX
- Berke Durak:
Two-Way Finite Automata with a Write-Once Track.
97-115 BibTeX
- Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt:
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.
117-138 BibTeX
- Viliam Geffert:
State Hierarchy for One-Way Finite Automata.
139-145 BibTeX
- Gregor Gramlich, Ralf Herrmann:
Learning Unary Automata.
147-165 BibTeX
- Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez:
Multi-dimensional Descriptional Complexity of P Systems.
167-179 BibTeX
- Yo-Sub Han, Gerhard Trippen, Derick Wood:
Simple-Regular Expressions and Languages.
181-194 BibTeX
- Markus Holzer, Martin Kutrib, Jens Reimann:
Non-Recursive Trade-Offs for Deterministic Restarting Automata.
195-213 BibTeX
- Christos A. Kapoutsis:
Deterministic Moles Cannot Solve Liveness.
215-235 BibTeX
- Miklós Krész:
Graph Decomposition and Descriptional Complexity of Soliton Automata.
237-263 BibTeX
- Andreas Malcher:
On Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata.
265-277 BibTeX
- Libor Polák:
Remarks on Multiple Entry Deterministic Finite Automata.
279-288 BibTeX
- Bettina Sunckel:
On the Descriptional Complexity of CD Grammar Systems of Finite Index.
289-306 BibTeX
- György Vaszil:
Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components.
307-315 BibTeX
- Sergey Verlan:
On Minimal Context-Free Insertion-Deletion Systems.
317-328 BibTeX
Volume 12,
Number 3,
2007
Volume 12,
Number 4,
2007
Selected Papers dedicated to Weighted Automata
Copyright © Sun May 17 00:06:13 2009
by Michael Ley (ley@uni-trier.de)
