default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st CIAA 2016: Seoul, South Korea
- Yo-Sub Han, Kai Salomaa:
Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings. Lecture Notes in Computer Science 9705, Springer 2016, ISBN 978-3-319-40945-0
Invited Paper
- Bakhadyr Khoussainov, Jiamou Liu
:
Decision Problems for Finite Automata over Infinite Algebraic Structures. 3-11
Regular Papers
- Holger Bock Axelsen, Markus Holzer, Martin Kutrib:
The Degree of Irreversibility in Deterministic Finite Automata. 15-26 - Suna Bensch, Johanna Björklund, Martin Kutrib:
Deterministic Stack Transducers. 27-38 - Jorge Calvo-Zaragoza, Colin de la Higuera, José Oncina:
Computing the Expected Edit Distance from a String to a PFA. 39-50 - Akim Demaille:
Derived-Term Automata of Multitape Rational Expressions. 51-63 - Antonio Di Stasio, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi:
Solving Parity Games Using an Automata-Based Algorithm. 64-76 - Zoltán Ésik:
Ternary Equational Languages. 77-88 - Henning Fernau, Andreas Krebs:
Problems on Finite Automata and the Exponential Time Hypothesis. 89-100 - Akio Fujiyoshi:
A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata. 101-112 - Robert Glück:
A Practical Simulation Result for Two-Way Pushdown Automata. 113-124 - Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Nondeterministic Complexity of Operations on Closed and Ideal Languages. 125-137 - Oscar H. Ibarra, Ian McQuillan:
On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L. 138-149 - Jozef Jirásek Jr., Juraj Sebej:
Kuratowski Algebras Generated by Prefix-Free Languages. 150-162 - Christos A. Kapoutsis, Lamana Mulaffer:
A Logical Characterization of Small 2NFAs. 163-175 - Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
Experiments with Synchronizing Automata. 176-188 - Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis:
Implementation of Code Properties via Transducers. 189-201 - Emil Lerner:
On Synchronizing Automata and Uniform Distribution. 202-212 - Aleksandrs Belovs, J. Andres Montoya, Abuzer Yakaryilmaz:
Looking for Pairs that Hard to Separate: A Quantum Approach. 213-223 - Timothy Ng:
Prefix Distance Between Regular Languages. 224-235 - Daniel Prusa:
Complexity of Sets of Two-Dimensional Patterns. 236-247 - Shinnosuke Seki, Andrew Winslow:
The Complexity of Fixed-Height Patterned Tile Self-assembly. 248-259 - Martin Sulzmann, Kenny Zhuo Ming Lu:
Derivative-Based Diagnosis of Regular Expression Ambiguity. 260-272 - Markus Teichmann:
Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages. 273-284 - Peter Thiemann:
Derivatives for Enhanced Regular Expressions. 285-297 - Qichao Wang, Friedrich Otto:
Weighted Restarting Automata as Language Acceptors. 298-309 - Jakub Waszczuk, Agata Savary, Yannick Parmentier:
Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy. 310-321 - Nicolaas Weideman, Brink van der Merwe, Martin Berglund, Bruce W. Watson:
Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA. 322-334
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 2026-07-16 00:33 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
