| Description |
1 online resource (xiii, 358 pages) : illustrations (black and white) |
| Series |
Lecture notes in computer science ; 7982 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7982.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Invited Talks: Cover Languages and Implementations / Cezar Câmpeanu -- Automata for Codes / Helmut Jürgensen -- Applications of Symbolic Finite Automata / Margus Veanes -- Regular Papers: Computing Weights / Houda Abbad and Eric Laugerotte -- Partial Word DFAs / Eric Balkanski, F. Blanchet-Sadri, Matthew Kilgore, and B.J. Wyatt -- Using Regular Grammars for Event-Based Testing / Fevzi Belli and Mutlu Beyazıt -- Two-Pass Greedy Regular Expression Parsing / Niels Bjørn Bugge Grathwohl, Fritz Henglein, Lasse Nielsen, and Ulrik Terp Rasmussen -- Universal Witnesses for State Complexity of Basic Operations Combined with Reversal / Janusz Brzozowski and David Liu -- Trimming Visibly Pushdown Automata / Mathieu Caralp, Pierre-Alain Reynier, and Jean-Marc Talbot -- A Uniformization Theorem for Nested Word to Word Transductions / Dmitry Chistikov and Rupak Majumdar -- Towards Nominal Context-Free Model-Checking / Pierpaolo Degano, Gian-Luigi Ferrari, and Gianluca Mezzetti -- Implementation Concepts in Vaucanson 2 / Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, and Jacques Sakarovitch -- A Completion Algorithm for Lattice Tree Automata / Thomas Genet, Tristan Le Gall, Axel Legay, and Valérie Murat -- Approximate Matching between a Context-Free Grammar and a Finite-State Automaton / Yo-Sub Han, Sang-Ki Ko, and Kai Salomaa -- On Palindromic Sequence Automata and Applications / Md. Mahbubul Hasan, A.S.M. Sohidull Islam, M. Sohel Rahman, and Ayon Sen -- LALBLC A Program Testing the Equivalence of dpda's / Patrick Henry and Géraud Sénizergues -- Brzozowski's Minimization Algorithm--More Robust than Expected / Markus Holzer and Sebastian Jakobi -- Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages / Oscar H. Ibarra and Bala Ravikumar -- On the Boundary of Regular Languages / Jozef Jirásek and Galina Jirásková -- On the Length of Homing Sequences for Nondeterministic Finite State Machines / Natalia Kushik and Nina Yevtushenko -- Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties / Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, and Matthias Wendlandt -- Hyper-optimization for Deterministic Tree Automata / Andreas Maletti -- Lambda-confluence is undeciable for clearing restarting automata / František Mráz and Friedrich Otto -- Comparing two-dimensional one-marker automata to Sgraffito automata / Daniel Průša, František Mráz, and Friedrich Otto -- Deterministic counter machines and parallel matching computations / Stefano Crespi Reghizzi and Pierluigi San Pietro -- Early Nested Word Automata for XPath Query Answering on XML Streams / Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, and Mohamed Zergaoui -- Invertible Transducers, Iteration and Coordinates / Klaus Sutner -- Compressed Automata for Dictionary Matching / Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda -- Short Papers: Enhancing Approximations for Regular Reachability Analysis / Aloı̈s Dreyfus, Pierre-Cyrille Héam, and Olga Kouchnarenko -- Generating Small Automata and the Černý Conjecture / Andrzej Kisielewicz and Marek Szykula -- Incomplete Transition Complexity of Basic Operations on Finite Languages / Eva Maia, Nelma Moreira, and Rogério Reis |
| Summary |
This book constitutes the thoroughly refereed papers of the 18th International Conference on Implementation and Application of Automata, CIAA 2013, held in Halifax, NS, Canada, in July 2013. The 25 revised full papers presented together with 3 invited papers and 7 short papers were carefully selected from 43 submissions. The papers cover various topics such as complexity of automata; compressed automata; counter automata; dictionary matching; edit distance; homing sequences; implementation; minimization of automata; model checking; parsing of regular expressions; partial word automata; picture languages; pushdown automata; queue automata; reachability analysis for software verification; restarting automata; transducers; tree automata; weighted automata; XML streams |
| Notes |
International conference proceedings |
|
Includes author index |
|
Print version record |
| Subject |
Machine theory -- Congresses
|
|
Robotics -- Congresses
|
|
Robotics.
|
|
Robotics
|
|
Machine theory
|
|
Robotics
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Konstantinidis, Stavros, editor.
|
| ISBN |
9783642392740 |
|
3642392741 |
|
