default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. DCFS 2004: London, Ontario, Canada
- Lucian Ilie, Detlef Wotschke:
6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26 - 28, 2004. Pre-proceedings. Department of Computer Science, The University of Western Ontario, Canada 2004, ISBN 0-7714-2506-6
Invited Papers
- Janusz A. Brzozowski, Helmut Jürgensen:
Representation of Semiautomata by Canonical Words and Equivalences. DCFS 2004: 13-27 - Jürgen Dassow:
On the Descriptional Complexity of Lindenmayer Systems. DCFS 2004: 28-36 - Michael Domaratzki, Kai Salomaa:
Restricted sets of trajectories and decidability of shuffle decompositions. DCFS 2004: 37-51 - Lane A. Hemaspaandra:
Advice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties. DCFS 2004: 52-66 - Helmut Jürgensen:
Synchronization of Communication. DCFS 2004: 67-81 - Chandra M. R. Kintala:
Models of Self-healing Software Systems. DCFS 2004: 82-82 - Martin Kutrib:
The Phenomenon of Non-Recursive Trade-Offs. DCFS 2004: 83-97 - Hing Leung:
Descriptional Complexity of NFAs of Different Ambiguity. DCFS 2004: 98-107
Submitted Papers
- Henning Bordihn, Helmut Jürgensen:
Pushdown Information. DCFS 2004: 111-120 - Cezar Câmpeanu, Andrei Paun:
Lower bounds for NFA to DCFA Transformations. DCFS 2004: 121-130 - Jean-Marc Champarnaud, Franck Guingne, Georges Hansel:
Reducing Cover Subsequential Transducers. DCFS 2004: 131-144 - Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi:
Follow Automaton versus Equation Automaton. DCFS 2004: 145-153 - Liliana Cojocaru:
On the time, space and communication complexity of q-fair languages. DCFS 2004: 154-163 - Zhe Dang, Oscar H. Ibarra:
On P Systems Operating in Sequential Mode. DCFS 2004: 164-177 - Michael Domaratzki, Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang:
Non-Uniqueness and Radius of Cyclic Unary NFAs. DCFS 2004: 178-190 - Rudolf Freund, Marion Oswald, Andrei Paun:
Gemmating P Systems are Computationally Complete with Four Membranes. DCFS 2004: 191-203 - Galina Jirásková:
The Complexity of Las Vegas Automata Problems. DCFS 2004: 204-212 - Christos A. Kapoutsis:
From k + 1 to k heads the descriptive trade-off is non-recursive. DCFS 2004: 213-224 - Alexander Okhotin:
A characterization of the arithmetical hierarchy by language equations. DCFS 2004: 225-237 - Libor Polák:
Minimalizations of NFA Using the Universal Automaton. DCFS 2004: 238-249 - Vaka Jaya Prakash, Kamala Krithivasan:
Leftmost Rewriting Tissue P Systems. DCFS 2004: 250-259 - Bettina Sunckel:
On the Descriptional Complexity of Metalinear CD Grammar Systems. DCFS 2004: 260-273 - Lynette van Zijl:
Magic Numbers for Symmetric Difference NFAs. DCFS 2004: 274-284
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-12-04 01:25 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:
