default search action
7. DCFS 2005: Como, Italy
- Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke:
7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings. Università degli Studi di Milano, Milan, Italy 2005
Invited Papers
- Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Some formal methods for analyzing quantum automata. DCFS 2005: 1-14 - Egon Börger:
Using Abstract State Machines for the Description and the Analysis of Formal Systems. DCFS 2005: 15-22 - Viliam Geffert:
(Non)determinism and the Size of One-Way Finite Automata. DCFS 2005: 23-37 - Juraj Hromkovic, Georg Schnitger:
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. DCFS 2005: 38-38 - Ludwig Staiger:
The Kolmogorov complexity of infinite objects. DCFS 2005: 39-50
Regular Papers
- Henning Bordihn, Henning Fernau:
The degree of parallelism. DCFS 2005: 51-62 - Henning Bordihn, Bettina Sunckel:
On active symbols in CD grammar systems. DCFS 2005: 63-74 - Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Large NFA Without Mergeable States. DCFS 2005: 75-84 - Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit:
Enumeration of Context-Free Languages and Related Structures. DCFS 2005: 85-96 - Berke Durak:
Two-way non-deterministic finite automata with a write-once track recognize regular languages only. DCFS 2005: 97-109 - Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt:
Refining the Nonterminal Complexity of Graph-controlled Grammars. DCFS 2005: 110-121 - Gregor Gramlich, Ralf Herrmann:
Learning Unary Automata. DCFS 2005: 122-133 - Miguel Angel Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez:
Multidimensional Descriptional Complexity of P Systems. DCFS 2005: 134-145 - Yo-Sub Han, Gerhard Trippen, Derick Wood:
Simple-Regular Expressions and Languages. DCFS 2005: 146-157 - Markus Holzer, Martin Kutrib, Jens Reimann:
Descriptional Complexity of Deterministic Restarting Automata. DCFS 2005: 158-169 - Marek Hricko, Galina Jirásková, Alexander Szabari:
Union and Intersection of Regular Languages and Descriptional Complexity. DCFS 2005: 170-181 - Galina Jirásková, Alexander Okhotin:
State complexity of cyclic shift. DCFS 2005: 182-193 - Christos A. Kapoutsis:
Deterministic moles cannot solve liveness. DCFS 2005: 194-205 - Lila Kari, Petr Sosík:
On Weight of Universal Insertion Grammars. DCFS 2005: 206-214 - Andreas Malcher:
On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata. DCFS 2005: 215-226 - György Vaszil:
Non-returning PC Grammar Systems Generate Any Recursively Enumerable Language with Eight Context-free Components. DCFS 2005: 227-235
Short Papers
- Franziska Biegler:
Synchronization Functions of Synchronized Context-Free Grammars and Languages. DCFS 2005: 236-244 - Miklós Krész:
On the descriptional complexity of soliton automata. DCFS 2005: 245-252 - Lakshmanan Kuppusamy:
Incompatible Measures of Internal Contextual Grammars. DCFS 2005: 253-260 - Libor Polák:
Remarks on Multiple Entry Deterministic Finite Automata. DCFS 2005: 261-268 - Rogério Reis, Nelma Moreira, Marco Almeida:
On the Representation of Finite Automata. DCFS 2005: 269-276 - Bettina Sunckel:
A note on the descriptional complexity of CD grammar systems of finite index. DCFS 2005: 277-284 - Sergey Verlan:
On minimal context-free insertion-deletion systems. DCFS 2005: 285-292
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 2024-12-13 18:59 CET 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: