3. DCAGRS 2001:
Vienna,
Austria
Jürgen Dassow, Detlef Wotschke (Eds.):
Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20 - 22, 2001. Preproceedings.
Preprint Nr. 16 Fakultät für Informatik, Universität Magdeburg, Magdeburg, Germany 2001 
Invited Talks
- Juraj Hromkovic:
Descriptional Complexity of Regular Languages (Concepts and Open Problems).
11-13
- Alexander Meduna:
Descriptional Complexity of Partially Parallel Grammars.
15-21
Submitted Papers
- Henry N. Adorna:
3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata.
23-34
- K. Arthi, Kamala Krithivasan, Erzsébet Csuhaj-Varjú:
On the Number of Rules in Components of Cooperating Distributed Grammar Systems with Probabilities.
35-46
- Henning Bordihn, Bernd Reichel:
On Descriptions of Context-Free Languages by CD Grammar Systems.
47-53
- Michael Domaratzki:
State Complexity and Proportional Removals.
55-66
- Michael Domaratzki, Derek Kisman, Jeffrey Shallit:
On the Number of Distinct Languages Accepted by Finite Automata with n States.
67-78
- Henning Fernau, Markus Holzer:
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.
79-90
- Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo:
Finite Codes over Free Binoids.
91-101
- Martin Kutrib:
Refining Nondeterminism below Linear-Time.
103-114
- Hing Leung, Viktor Podolskiy:
The Limitedness Problem on Distance Automata.
115-121
- Andreas Malcher:
Descriptional Complexity of Cellular Automata and Decidability Questions.
123-131
- Carlos Martín-Vide, Victor Mitrana:
Grammars with Bounded-Life Resources.
133-140
- Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini:
On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata.
141-148
- Jakub Neumann, Andrzej Szepietowski:
The Emptiness Problem for Weak Rabin Tree Automata.
149-158
- Martin Plátek, Frantisek Mráz:
Degrees of (Non)Monotonicity of RRW-Automata.
159-165
- M. Sakthi Balan:
Parallel Communicating Pushdown Automata with Filters in Communication.
167-175
- Patrice Séébold:
Some Properties of the Prouhet Morphism and Words.
177-186
- Ferucio Laurentiu Tiplea, Erkki Mäkinen:
On the Complexity of a Problem on Monadic String Rewriting Systems.
187-194
Last update Thu May 24 04:16:12 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
