default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th CIAA 2013: Halifax, NS, Canada
- Stavros Konstantinidis
:
Implementation and Application of Automata - 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings. Lecture Notes in Computer Science 7982, Springer 2013, ISBN 978-3-642-39273-3
Invited Talks
- Cezar Câmpeanu:
Cover Languages and Implementations. 1 - Helmut Jürgensen:
Automata for Codes. 2-15 - Margus Veanes:
Applications of Symbolic Finite Automata. 16-23
Regular Papers
- Houda Abbad, Éric Laugerotte:
Computing Weights. 24-35 - Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt:
Partial Word DFAs. 36-47 - Fevzi Belli, Mutlu Beyazit:
Using Regular Grammars for Event-Based Testing. 48-59 - Niels Bjørn Bugge Grathwohl, Fritz Henglein, Lasse Nielsen, Ulrik Terp Rasmussen:
Two-Pass Greedy Regular Expression Parsing. 60-71 - Janusz A. Brzozowski, David Liu:
Universal Witnesses for State Complexity of Basic Operations Combined with Reversal. 72-83 - Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot:
Trimming Visibly Pushdown Automata. 84-96 - Dmitry Chistikov, Rupak Majumdar:
A Uniformization Theorem for Nested Word to Word Transductions. 97-108 - Pierpaolo Degano, Gian-Luigi Ferrari, Gianluca Mezzetti:
Towards Nominal Context-Free Model-Checking. 109-121 - Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Jacques Sakarovitch:
Implementation Concepts in Vaucanson 2. 122-133 - Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat:
A Completion Algorithm for Lattice Tree Automata. 134-145 - Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton. 146-157 - Md. Mahbubul Hasan, A. S. M. Sohidull Islam, M. Sohel Rahman, Ayon Sen:
On Palindromic Sequence Automata and Applications. 158-168 - Patrick Henry, Géraud Sénizergues:
LALBLC A Program Testing the Equivalence of dpda's. 169-180 - Markus Holzer, Sebastian Jakobi:
Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract). 181-192 - Oscar H. Ibarra, Bala Ravikumar:
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages. 193-207 - Jozef Jirásek, Galina Jirásková:
On the Boundary of Regular Languages. 208-219 - Natalia Kushik, Nina Yevtushenko:
On the Length of Homing Sequences for Nondeterministic Finite State Machines. 220-231 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt:
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. 232-243 - Andreas Maletti:
Hyper-optimization for Deterministic Tree Automata. 244-255 - Frantisek Mráz, Friedrich Otto:
Lambda-Confluence Is Undecidable for Clearing Restarting Automata. 256-267 - Daniel Prusa, Frantisek Mráz, Friedrich Otto:
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata. 268-279 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Deterministic Counter Machines and Parallel Matching Computations. 280-291 - Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui:
Early Nested Word Automata for XPath Query Answering on XML Streams. 292-305 - Klaus Sutner:
Invertible Transducers, Iteration and Coordinates. 306-318 - Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Automata for Dictionary Matching. 319-330
Short Papers
- Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko:
Enhancing Approximations for Regular Reachability Analysis. 331-339 - Andrzej Kisielewicz, Marek Szykula:
Generating Small Automata and the Černý Conjecture. 340-348 - Eva Maia, Nelma Moreira, Rogério Reis:
Incomplete Transition Complexity of Basic Operations on Finite Languages. 349-356
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-02-20 19: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:
