Description |
1 online resource |
Series |
Lecture notes in computer science, 0302-9743 ; 7381 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7381.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
Contents |
In Memoriam Sheng Yu / Yuan Gao and Kai Salomaa -- In Search of Most Complex Regular Languages / Janusz Brzozowski -- A Formal Framework for Processes Inspired by the Functioning of Living Cells / Andrzej Ehrenfeucht and Grzegorz Rozenberg -- Adding Pebbles to Weighted Automata / Paul Gastin and Benjamin Monmege -- Typed Linear Algebra for Weigthed (Probabilistic) Automata / José N. Oliveira -- A Pushdown Transducer Extension for the OpenFst Library / Cyril Allauzen and Michael Riley -- Weak Inclusion for Recursive XML Types / Joshua Amavi, Jacques Chabin and Pierre Réty -- Synchronizing Automata on Quasi-Eulerian Digraph / Mikhail V. Berlinkov -- Cellular Automata on Regular Rooted Trees / Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi and Zoran Šunić -- Strict Local Testability with Consensus Equals Regularity / Stefano Crespi Reghizzi and Pierluigi L. San Pietro -- Nominal Automata for Resource Usage Control / Pierpaolo Degano, Gian-Luigi Ferrari and Gianluca Mezzetti -- Weighted Nested Word Automata and Logics over Strong Bimonoids / Manfred Droste and Bundit Pibaljommee -- A Fast Suffix Automata Based Algorithm for Exact Online String Matching / Simone Faro and Thierry Lecroq -- P(l)aying for Synchronization / Fedor Fominykh and Mikhail Volkov -- Synchronizing Automata of Bounded Rank / Vladimir V. Gusev -- Automatic Theorem-Proving in Combinatorics on Words / Daniel Goč, Dane Henshall and Jeffrey Shallit -- How to Synchronize the Heads of a Multitape Automaton / Oscar H. Ibarra and Nicholas Q. Tran |
|
Regular Ideal Languages and Their Boolean Combinations / Franz Jahn, Manfred Kufleitner and Alexander Lauser -- Hyper-minimization for Deterministic Tree Automata / Artur Jeż and Andreas Maletti -- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs / Galina Jirásková and Tomáš Masopust -- Implementing Computations in Automaton (Semi)groups / Ines Klimann, Jean Mairesse and Matthieu Picantin -- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata / Martin Kutrib and Friedrich Otto -- A Disambiguation Algorithm for Finite Automata and Functional Transducers / Mehryar Mohri -- Synchronization of Automata with One Undefined or Ambiguous Transition / Pavel V. Martyugin -- Restarting Tiling Automata / Daniel Průša and František Mráz -- Crossing the Syntactic Barrier: Hom-Disequalities for H11-Clauses / Andreas Reuß and Helmut Seidl -- Factor and Subsequence Kernels and Signatures of Rational Languages / Ahmed Amarni and Sylvain Lombardy -- Multi-Tilde-Bar Derivatives / Pascal Caron, Jean-Marc Champarnaud and Ludovic Mignot -- On Positive TAGED with a Bounded Number of Constraints / Pierre-Cyrille Héam, Vincent Hugot and Olga Kouchnarenko -- SDFA: Series DFA for Memory-Efficient Regular Expression Matching / Tingwen Liu, Yong Sun, Li Guo and Binxing Fang -- The Removal of Weighted [epsilon]-Transitions / Sylvain Lombardy and Jacques Sakarovitch -- Weighted LTL with Discounting / Eleni Mandrali -- Automata with Modulo Counters and Nondeterministic Counter Bounds / Daniel Reidenbach and Markus L. Schmid |
Summary |
This book constitutes the thoroughly refereed papers of the 17th International Conference on Implementation and Application of Automata, CIAA 2012, held in Porto, Portugal, in July 2012. The 21 revised full papers presented together with 5 invited papers and 7 short papers were carefully selected from 53 submissions. The papers cover various topics such as automata applications in formal verification methods, natural language processing, pattern matching, data storage and retrieval, and bioinformatics, as well as theoretical work on automata theory |
Analysis |
Computer science |
|
Data structures (Computer science) |
|
Computer software |
|
Information storage and retrieval systems |
|
Mathematical Logic and Formal Languages |
Bibliography |
Includes bibliographical references and author index |
Notes |
English |
Subject |
Machine theory -- Congresses
|
|
Robotics -- Congresses
|
|
Informatique.
|
|
Machine theory
|
|
Robotics
|
Genre/Form |
Conference papers and proceedings
|
|
Software.
|
Form |
Electronic book
|
Author |
Moreira, Nelma
|
|
Reis, Rogério
|
ISBN |
9783642316067 |
|
3642316069 |
|
3642316050 |
|
9783642316050 |
|
9783642316074 |
|
3642316077 |
|