Selected Papers of the First International Workshop on Descriptional Complexity of Automata, Grammars, and Related Structures (DCAGRS, Magdeburg, Germany, July 20–23, 1999)

Jürgen Dassow, Detlef Wotschke:
Erzsébet Csuhaj-Varjú:
Parallel Communicating Grammar Systems with Bounded Resources: Results, Techniques, Open Problems175–190
Jozef Gruska:
Descriptional Complexity Issues in Quantum Computing191–218
Kosaburo Hashiguchi, Shin Ichihara, Shuji Jimbo:
Formal Languages over Free Binoids219–234
Hing Leung:
On a Family of Nondeterministic Finite Automata235–244
Holger Petersen:
Prefix Rewriting and Descriptional Complexity245–254
Jeffrey Shallit:
Automaticity and Rationality255–268
Martin Kappes:
Descriptional Complexity of Deterministic Finite Automata with Multiple Initial States269–278
Carlos Martín-Vide, Alexandru Mateescu:
Special Families of Sewing Languages279–286
Carlo Mereghetti, Giovanni Pighizzini:
Two-Way Automata Simulations and Unary Languages287–300
Victor Mitrana:
On the Degree of Communication in Parallel Communicating Finite Automata Systems301–314
Andrei Păun:
On the Diameter of Various Classes of H Systems315–324
Heinz Schmitz:
Restricted Temporal Logic and Deterministic Languages325–341
José M. Sempere:
On a Class of Regular-Like Expressions for Linear Languages343–354
Yuri Velinov:
Regions of Influence in Simple Decomposition Forms of Finite Functions355–366