default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14. DCFS 2012: Braga, Portugal
- Martin Kutrib
, Nelma Moreira, Rogério Reis:
Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings. Lecture Notes in Computer Science 7386, Springer 2012, ISBN 978-3-642-31622-7
Invited Papers
- Jean-Baptiste Jeannin, Dexter Kozen:
Computing with Capsules. 1-19 - Christos A. Kapoutsis:
Minicomplexity. 20-42 - André Platzer:
Logical Analysis of Hybrid Systems - A Complete Answer to a Complexity Challenge. 43-49 - Pedro V. Silva:
Groups and Automata: A Perfect Match. 50-63
Regular Papers
- Fernando Arroyo, Juan Castellanos, Victor Mitrana:
Uniform Distributed Pushdown Automata Systems. 64-75 - Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
Removing Nondeterminism in Constant Height Pushdown Automata. 76-88 - Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini:
On Inverse Operations and Their Descriptional Complexity. 89-102 - Francine Blanchet-Sadri, Sean Simmons:
Deciding Representability of Sets of Words of Equal Length. 103-116 - Janusz A. Brzozowski, Baiyu Li:
Syntactic Complexities of Some Classes of Star-Free Languages. 117-129 - Cezar Câmpeanu:
Randomness Behaviour in Blum Universal Static Complexity Spaces. 130-140 - Jürgen Dassow, Ronny Harbich:
Production Complexity of Some Operations on Context-Free Languages. 141-154 - Yuan Gao, Lila Kari:
State Complexity of Star and Square of Union of k Regular Languages. 155-168 - Markus Holzer, Sebastian Jakobi:
State Complexity of Chop Operations on Unary and Finite Languages. 169-182 - Artur Jez, Alexander Okhotin:
On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars. 183-195 - Galina Jirásková, Ondrej Klíma:
Descriptional Complexity of Biautomata. 196-208 - Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Pushdown Store Languages. 209-221 - Florin Manea, Bianca Truthe:
On Internal Contextual Grammars with Subregular Selection Languages. 222-235 - Alexander Meduna, Lukás Vrábel, Petr Zemek:
An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. 236-243 - Friedrich Otto:
Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata. 244-251 - Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity and Limited Nondeterminism. 252-265 - Holger Petersen:
Bounded Counter Languages. 266-279 - Xiaoxue Piao, Kai Salomaa:
State Complexity of Projection and Quotient on Unranked Trees. 280-293 - Klaus Sutner, Kevin Lewi:
Iterating Invertible Binary Transducers. 294-306 - Brink van der Merwe, Hellis Tamm, Lynette van Zijl:
Minimal DFA for Symmetric Difference NFA. 307-318
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-12-08 09:48 CET 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:
