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
• 
  Henning Bordihn, Henning Fernau: The Degree of Parallelism. 25-47
• 
  Henning Bordihn, Bettina Sunckel: On Active Symbols in CD Grammar Systems. 49-67
• 
  Cezar Câmpeanu, Nicolae Santean, Sheng Yu: A Family of NFAs Free of State Reductions. 69-78
• 
  Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit: Enumeration of Context-Free Languages and Related Structures. 79-95
• 
  Berke Durak: Two-Way Finite Automata with a Write-Once Track. 97-115
• 
  Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt: Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. 117-138
• 
  Viliam Geffert: State Hierarchy for One-Way Finite Automata. 139-145
• 
  Gregor Gramlich, Ralf Herrmann: Learning Unary Automata. 147-165
• 
  Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez: Multi-dimensional Descriptional Complexity of P Systems. 167-179
• 
  Yo-Sub Han, Gerhard Trippen, Derick Wood: Simple-Regular Expressions and Languages. 181-194
• 
  Markus Holzer, Martin Kutrib, Jens Reimann: Non-Recursive Trade-Offs for Deterministic Restarting Automata. 195-213
• 
  Christos A. Kapoutsis: Deterministic Moles Cannot Solve Liveness. 215-235
• 
  Miklós Krész: Graph Decomposition and Descriptional Complexity of Soliton Automata. 237-263
• 
  Andreas Malcher: On Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata. 265-277
• 
  Libor Polák: Remarks on Multiple Entry Deterministic Finite Automata. 279-288
• 
  Bettina Sunckel: On the Descriptional Complexity of CD Grammar Systems of Finite Index. 289-306
• 
  György Vaszil: Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components. 307-315
• 
  Sergey Verlan: On Minimal Context-Free Insertion-Deletion Systems. 317-328

Volume 12, Number 3, 2007

• 
  Frank Drewes, Heiko Vogler: Learning Deterministically Recognizable Tree Series. 332-354
• 
  Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel: Monotonicity of Restarting Automata. 355-371
• 
  Ruggero Lanotte: Expressive Power of Hybrid Systems with Real Variables, Integer Variables and Arrays. 373-405
• 
  Daniel Reidenbach: An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages. 407-426

Volume 12, Number 4, 2007

Selected Papers dedicated to Weighted Automata

• 
  Zoltán Ésik, Werner Kuich: A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series. 435-454
• 
  George Rahonis: Weighted Muller Tree Automata and Weighted Logics. 455-483
• 
  Sibylle Schwarz: Lukasiewicz Logic and Weighted Logics over MV-Semirings. 485-499
• 
  Catalin Ionut Tîrnauca, Cristina Tîrnauca: Learning Regular Tree Languages from Correction and Equivalence Queries. 501-524
• 
  German Tischler: On Computability and some Decision Problems of Parametric Weighted Finite Automata. 525-544
• 
  Johannes Waldmann: Weighted Automata for Proving Termination of String Rewriting. 545-570