default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16. DCFS 2014: Turku, Finland
- Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin:
Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings. Lecture Notes in Computer Science 8614, Springer 2014, ISBN 978-3-319-09703-9 - Andris Ambainis:
Recent Developments in Quantum Algorithms and Complexity. 1-4 - Oscar H. Ibarra:
Automata with Reversal-Bounded Counters: A Survey. 5-22 - Manfred Kufleitner
:
Star-Free Languages and Local Divisors. 23-28 - Nikolay K. Vereshchagin:
Aperiodic Tilings by Right Triangles. 29-41 - Farid M. Ablayev, Marat Ablayev:
Quantum Hashing via ε-Universal Hashing Constructions and Freivalds' Fingerprinting Schemas. 42-52 - Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz:
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs. 53-64 - Artiom Alhazov, Bogdan Aman, Rudolf Freund, Gheorghe Paun:
Matter and Anti-Matter in Membrane Systems. 65-76 - Angelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti:
Complexity of Extended vs. Classic LR Parsers. 77-89 - Janusz A. Brzozowski, Gareth Davies:
Most Complex Regular Right-Ideal Languages. 90-101 - Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State Complexity of Inversion Operations. 102-113 - Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Cycles and Global Attractors of Reaction Systems. 114-125 - Viliam Geffert, Abuzer Yakaryilmaz:
Classical Automata on Promise Problems. 126-137 - Mai Gehrke, Andreas Krebs, Jean-Éric Pin:
From Ultrafilters on Words to the Expressive Power of a Fragment of Logic. 138-149 - Daniel Goc, Kai Salomaa:
Computation Width and Deviation Number. 150-161 - Markus Holzer, Sebastian Jakobi:
Boundary Sets of Regular and Context-Free Languages. 162-173 - Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán:
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal. 174-185 - Sergiu Ivanov, Elisabeth Pelz, Sergey Verlan:
Small Universal Non-deterministic Petri Nets with Inhibitor Arcs. 186-197 - Jan Janousek, Borivoj Melichar, Radomír Polách, Martin Poliak, Jan Trávnícek:
A Full and Linear Index of a Tree for Tree Patterns. 198-209 - Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej:
Prefix-Free Languages: Right Quotient and Reversal. 210-221 - Galina Jirásková, Peter Mlynárcik:
Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages. 222-233 - Prateek Karandikar, Philippe Schnoebelen:
On the State Complexity of Closures and Interiors of Regular Languages with Subwords. 234-245 - Sang-Ki Ko, Ha-Rim Lee, Yo-Sub Han:
State Complexity of Regular Tree Languages for Tree Pattern Matching. 246-257 - Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
On the Complexity of L-reachability. 258-269 - Olga Dorzweiler, Thomas Flamm, Andreas Krebs, Michael Ludwig:
Positive and Negative Proofs for Circuits and Branching Programs. 270-281 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Regularity and Size of Set Automata. 282-293 - Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki:
Operational State Complexity under Parikh Equivalence. 294-305 - Marina I. Maslennikova:
Complexity of Checking Whether Two Automata Are Synchronized by the Same Language. 306-317 - Friedrich Otto:
On the Descriptional Complexity of Deterministic Ordered Restarting Automata. 318-329 - Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism. 330-341 - Holger Petersen:
A Note on Pushdown Automata Systems. 342-351 - Daniel Prusa:
Non-recursive Trade-offs between Two-Dimensional Automata and Grammars. 352-363
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-23 00:30 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:
