EPTCS 3 - DCFS 2009
Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe (Eds.): Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems. 2009 EPTCS 3 [ contents ]- 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
- 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
- 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
- Viliam Geffert, Lubomíra Istonová: Translation from Classical Two-Way Automata to Pebble Two-Way Automata. ... 131-140
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team