| Description |
1 online resource (xiii, 298 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 6807 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 6807. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Machine generated contents note: Invited Lectures -- Derick Wood: Always in Our Hearts / Sheng Yu -- Streamable Fragments of Forward XPath / Joachim Niehren -- Gaining Power by Input Operations: Finite Automata and Beyond / Martin Kutrib -- Technical Contributions -- Weak Inclusion for XML Types / Pierre Rety -- Categorial Grammars with Iterated Types Form a Strict Hierarchy of k-Valued Languages / Annie Foret -- Bouma2 -- A High-Performance Input-Aware Multiple String-Match Algorithm / Erez Buchnik -- Random Generation of Deterministic Acyclic Automata Using Markov Chains / Sven De Felice -- Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability / Rodrigo Castano -- Nondeterministic Moore Automata and Brzozowski's Algorithm / Marinella Sciortino -- Building Phylogeny with Minimal Absent Words / Maxime Crochemore -- On the Hardness of Priority Synthesis / Alois Knoll -- ̂ Smaller Representation of Finite State Automata / Dawid Weiss -- Compositional Failure Detection in Structured Transition Systems / Wolfgang Thomas -- Chrobak Normal Form Revisited, with Applications / Pawel Gawrychowski -- Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule / Sang-Ki Ko -- Loops and Overloops for Tree Walking Automata / Olga Kouchnarenko -- Nondeterministic State Complexity of Star-Free Languages / Katja Meckel -- On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs / Oscar H. Ibarra -- Computing All l-Cover Automata Fast / Andreas Maletti -- Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines / Nina Yevtushenko -- Towards More Expressive 2D Deterministic Automata / Matteo Pradella -- Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata / Pavel Martyugin -- Distributed Event Clock Automata (Extended Abstract) / |
|
Note continued: Fly-Automata, Their Properties and Applications / Irene A. Durand -- Tree Template Matching in Ranked Ordered Trees by Pushdown Automata / Solon P. Pissis -- Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach / Milos Pajic -- Experimental Study of the Shortest Reset Word of Random Automata / Evgeny Tipikin |
| Summary |
Annotation This book constitutes the thoroughly refereed papers of the 16th International Conference on Implementation and Application of Automata, CIAA 2011, held in Blois, France, in July 2011. The 20 revised full papers together with 4 short papers were carefully selected from 38 submissions. The papers cover various topics such as applications of automata in computer-aided verification; natural language processing; pattern matching, data storage and retrieval; document engineering and bioinformatics as well as foundational work on automata theory |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| Subject |
Machine theory -- Congresses
|
|
Informatique.
|
|
Machine theory
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Bouchou-Markhoff, Béatrice.
|
| ISBN |
9783642222566 |
|
3642222560 |
|
