default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th AFL 2014, Szeged, Hungary
- Zoltán Ésik, Zoltán Fülöp:
Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014. EPTCS 151, 2014 - Arnaud Carayol, Matthew Hague
:
Saturation algorithms for model-checking pushdown systems. 1-24 - Hermann Gruber, Markus Holzer:
From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity. 25-48 - Ondrej Klíma:
On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract). 49-54 - Christof Löding:
Decision Problems for Deterministic Pushdown Automata on Infinite Words. 55-73 - Sebastian Maneth:
Equivalence Problems for Tree Transducers: A Brief Survey. 74-93 - Mikhail Barash, Alexander Okhotin:
Grammars with two-sided contexts. 94-108 - Martin Berglund, Frank Drewes, Brink van der Merwe:
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching. 109-123 - Henning Bordihn, Martin Kutrib, Andreas Malcher:
Measuring Communication in Parallel Communicating Finite Automata. 124-138 - Karel Brinda:
Languages of lossless seeds. 139-150 - Janusz A. Brzozowski, Gareth Davies:
Maximally Atomic Languages. 151-161 - Cezar Câmpeanu:
Simplifying Nondeterministic Finite Cover Automata. 162-173 - Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas:
Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words. 174-187 - Vincent Carnino, Sylvain Lombardy:
On Determinism and Unambiguity of Weighted Two-way Automata. 188-200 - Kristína Cevorová, Galina Jirásková, Peter Mlynárcik, Matús Palmovský, Juraj Sebej:
Operations on Automata with All States Final. 201-215 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Commutative Languages and their Composition by Consensual Methods. 216-230 - Chen Fei Du, Jeffrey O. Shallit:
Similarity density of the Thue-Morse word with overlap-free infinite binary words. 231-245 - Henning Fernau, Rudolf Freund, Markus Holzer:
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes. 246-260 - László Hegedüs, Benedek Nagy:
Representations of Circular Words. 261-270 - Markus Holzer, Sebastian Jakobi:
More Structural Characterizations of Some Subregular Language Families by Biautomata. 271-285 - Milka Hutagalung, Martin Lange, Étienne Lozes:
Buffered Simulation Games for Büchi Automata. 286-300 - Szabolcs Iván:
Synchronizing weighted automata. 301-313 - Andreas Maletti, Daniel Quernheim:
Hyper-Minimization for Deterministic Weighted Tree Automata. 314-326 - Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi:
$k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions. 327-341 - Maris Valdats:
Boolean Circuit Complexity of Regular Languages. 342-354 - Antti Valmari:
Character Strings and Gödel's Incompleteness Proof. 355-369 - Vojtech Vorel:
Subset Synchronization of Transitive Automata. 370-381
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-03-07 01:01 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:
