default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13. 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
- Jarkko Kari:
Linear Algebra Based Bounds for One-Dimensional Cellular Automata. 1-7 - Friedrich Otto:
On Restarting Automata with Window Size One. 8-33 - Stefan Schwoon, César Rodríguez:
Construction and SAT-Based Verification of Contextual Unfoldings. 34-42 - Denis Thérien:
The Power of Diversity. 43-54
Regular Papers
- Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey O. 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 O. Shallit, David A. Wilson:
Remarks on Separating Words. 147-157 - Yuan Gao, Sheng Yu:
State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal. 158-171 - Radu Gramatovici, Florin Manea:
k-Local Internal Contextual Grammars. 172-183 - Oscar H. Ibarra, Nicholas Q. Trân:
On Synchronized Multitape and Multihead Automata. 184-197 - Galina Jirásková, Tomás Masopust:
State Complexity of Projected Languages. 198-211 - Galina Jirásková, Juraj Sebej:
Note on Reversal of Binary Regular Languages. 212-221 - Michal Kunc, Alexander Okhotin:
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. 222-234 - Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade:
Kleene Theorems for Product Systems. 235-247 - Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. 248-260 - Xiaoxue Piao, Kai Salomaa:
State Trade-Offs in Unranked Tree Automata. 261-274 - 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 - Maris Valdats:
Transition Function Complexity of Finite Automata. 301-313 - Jirí Wiedermann:
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences. 314-327
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-04-03 00:01 CEST 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:
