default search action
13. DCFS 2011: Gießen/Limburg, Germany
Markus Holzer, Martin Kutrib, Giovanni Pighizzini:
Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings. Lecture Notes in Computer Science 6808, Springer 2011, ISBN 978-3-642-22599-4
Invited Papers
- Stefan Schwoon, César Rodríguez:
Construction and SAT-Based Verification of Contextual Unfoldings. 34-42
Regular Papers
- Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit:
Decidability and Shortest Strings in Formal Languages. 55-67 - Fernando Arroyo, Juan Castellanos, Victor Mitrana:
On the Degree of Team Cooperation in CD Grammar Systems. 68-79 - Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. 80-92 - Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages. 93-106 - Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne:
Geometrical Regular Languages and Linear Diophantine Equations. 107-120 - Erzsébet Csuhaj-Varjú, György Vaszil:
On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems. 121-134 - Jürgen Dassow, Florin Manea, Bianca Truthe:
On Contextual Grammars with Subregular Selection Languages. 135-146 - Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson:
Remarks on Separating Words. 147-157 - Michal Kunc, Alexander Okhotin:
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. 222-234 - Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. 248-260 - Shankara Narayanan Krishna, Gabriel Ciobanu:
A S2P ÈP2P\Sigma_2^P \cup \Pi_2^P Lower Bound Using Mobile Membranes. 275-288 - Sherzod Turaev, Jürgen Dassow, Mohd Hasan Selamat:
Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity. 289-300 - Jirí Wiedermann:
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences. 314-327
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2015-03-01 01:03 CET by the dblp team