6. DCFS 2004:
London,
Ontario,
Canada
Lucian Ilie, Detlef Wotschke (Eds.):
6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26 - 28, 2004. Pre-proceedings.
Report No. 619 Department of Computer Science, The University of Western Ontario, Canada 2004, ISBN 0-7714-2506-6 
Invited Papers
Submitted Papers
- Henning Bordihn, Helmut Jürgensen:
Pushdown Information.
111-120
- Cezar Câmpeanu, Andrei Paun:
Lower bounds for NFA to DCFA Transformations.
121-130
- Jean-Marc Champarnaud, Franck Guingne, Georges Hansel:
Reducing Cover Subsequential Transducers.
131-144
- Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi:
Follow Automaton versus Equation Automaton.
145-153
- Liliana Cojocaru:
On the time, space and communication complexity of q-fair languages.
154-163
- Zhe Dang, Oscar H. Ibarra:
On P Systems Operating in Sequential Mode.
164-177
- Michael Domaratzki, Keith Ellul, Jeffrey Shallit, Ming-wei Wang:
Non-Uniqueness and Radius of Cyclic Unary NFAs.
178-190
- Rudolf Freund, Marion Oswald, Andrei Paun:
Gemmating P Systems are Computationally Complete with Four Membranes.
191-203
- Galina Jirásková:
The Complexity of Las Vegas Automata Problems.
204-212
- Christos A. Kapoutsis:
From k + 1 to k heads the descriptive trade-off is non-recursive.
213-224
- Alexander Okhotin:
A characterization of the arithmetical hierarchy by language equations.
225-237
- Libor Polák:
Minimalizations of NFA Using the Universal Automaton.
238-249
- Vaka Jaya Prakash, Kamala Krithivasan:
Leftmost Rewriting Tissue P Systems.
250-259
- Bettina Sunckel:
On the Descriptional Complexity of Metalinear CD Grammar Systems.
260-273
- Lynette van Zijl:
Magic Numbers for Symmetric Difference NFAs.
274-284
Last update Thu May 24 04:16:11 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
