default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. DCAGRS 2001: Vienna, Austria
- Jürgen Dassow, Detlef Wotschke:
Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20 - 22, 2001. Preproceedings. Fakultät für Informatik, Universität Magdeburg, Magdeburg, Germany 2001
Invited Talks
- Juraj Hromkovic:
Descriptional Complexity of Regular Languages (Concepts and Open Problems). DCFS 2001: 11-13 - Alexander Meduna:
Descriptional Complexity of Partially Parallel Grammars. DCFS 2001: 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. DCFS 2001: 23-34 - K. Arthi, Kamala Krithivasan, Erzsébet Csuhaj-Varjú:
On the Number of Rules in Components of Cooperating Distributed Grammar Systems with Probabilities. DCFS 2001: 35-46 - Henning Bordihn, Bernd Reichel:
On Descriptions of Context-Free Languages by CD Grammar Systems. DCFS 2001: 47-53 - Michael Domaratzki:
State Complexity and Proportional Removals. DCFS 2001: 55-66 - Michael Domaratzki, Derek Kisman, Jeffrey O. Shallit:
On the Number of Distinct Languages Accepted by Finite Automata with n States. DCFS 2001: 67-78 - Henning Fernau, Markus Holzer:
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. DCFS 2001: 79-90 - Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo:
Finite Codes over Free Binoids. DCFS 2001: 91-101 - Martin Kutrib:
Refining Nondeterminism below Linear-Time. DCFS 2001: 103-114 - Hing Leung, Viktor Podolskiy:
The Limitedness Problem on Distance Automata. DCFS 2001: 115-121 - Andreas Malcher:
Descriptional Complexity of Cellular Automata and Decidability Questions. DCFS 2001: 123-131 - Carlos Martín-Vide, Victor Mitrana:
Grammars with Bounded-Life Resources. DCFS 2001: 133-140 - Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini:
On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. DCFS 2001: 141-148 - Jakub Neumann, Andrzej Szepietowski:
The Emptiness Problem for Weak Rabin Tree Automata. DCFS 2001: 149-158 - Martin Plátek, Frantisek Mráz:
Degrees of (Non)Monotonicity of RRW-Automata. DCFS 2001: 159-165 - M. Sakthi Balan:
Parallel Communicating Pushdown Automata with Filters in Communication. DCFS 2001: 167-175 - Patrice Séébold:
Some Properties of the Prouhet Morphism and Words. DCFS 2001: 177-186 - Ferucio Laurentiu Tiplea, Erkki Mäkinen:
On the Complexity of a Problem on Monadic String Rewriting Systems. DCFS 2001: 187-194
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-04 23:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
