


default search action
11th DCFS 2009: Magdeburg, Germany
- Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe:
Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, Magdeburg, Germany, July 6-9, 2009. EPTCS 3, 2009 - Christel Baier, Nathalie Bertrand
, Marcus Größer:
Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability. 3-16 - Janusz A. Brzozowski:
Quotient Complexity of Regular Languages. 17-28 - John Jack, Andrei Paun:
The Nondeterministic Waiting Time Algorithm: A Review. 29-46 - Marco Almeida, Nelma Moreira
, Rogério Reis
:
Testing the Equivalence of Regular Languages. 47-57 - M. Sakthi Balan
:
Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems. 59-68 - Fevzi Belli, Mutlu Beyazit
:
Mutation of Directed Graphs -- Corresponding Regular Expressions and Complexity of Their Generation. 69-77 - Franziska Biegler, Mark Daley, Ian McQuillan:
On the Shuffle Automaton Size for Words. 79-89 - Erzsébet Csuhaj-Varjú, György Vaszil:
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems. 91-100 - Rudolf Freund, Andreas Klein, Martin Kutrib
:
On the Number of Membranes in Unary P Systems. 101-109 - Pierluigi Frisco, Oscar H. Ibarra:
On Languages Accepted by P/T Systems Composed of joins. 111-120 - Yuan Gao, Sheng Yu:
State Complexity Approximation. 121-130 - Viliam Geffert, Lubomíra Istonová:
Translation from Classical Two-Way Automata to Pebble Two-Way Automata. 131-140 - Hermann Gruber
, Markus Holzer
, Martin Kutrib
:
On Measuring Non-Recursive Trade-Offs. 141-150 - Galina Jirásková
, Alexander Okhotin
:
Nondeterministic State Complexity of Positional Addition. 151-161 - Martin Kutrib
, Andreas Malcher
:
Bounded Languages Meet Cellular Automata with Sparse Communication. 163-172 - Remco Loos
, Florin Manea, Victor Mitrana
:
Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections. 173-182 - Tomás Masopust
, Alexander Meduna
:
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement. 183-192 - Ralf Stiebe, Sherzod Turaev
:
Capacity Bounded Grammars and Petri Nets. 193-203

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.