Implementation and Application of Automata: 12th International Conference, Ciaa 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers

Holub, Jan (Editor)/ Zdarek, Jan (Editor)

ISBN 10: 354076335X / ISBN 13: 9783540763352

Editore: Springer-Verlag New York Inc, 2007

Riguardo questo articolo

1st edition. 324 pages. 9.21x6.19x0.78 inches. In Stock.

Codice articolo x-354076335X

Dati bibliografici

• Titolo: Implementation and Application of Automata: 12th International Conference, Ciaa 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers
• Editore: Springer-Verlag New York Inc
• Data di pubblicazione: 2007
• Lingua: Inglese
• ISBN 10: 354076335X
• ISBN 13: 9783540763352
• Rilegatura: Paperback
• Condizione: Brand New
• Peso: 0,5 chilogrammi

Descrizione articolo

Riassunto

This book constitutes the thoroughly refereed post-proceedings of the 12th International Conference on Implementation and Application of Automata, CIAA 2007. The 23 revised full papers and seven revised poster papers presented together with the extended abstracts of four invited lectures were carefully reviewed and have gone through two rounds of reviewing. The papers cover various topics in the theory, implementation, and applications of automata and related structures.

Contenuti

Invited Talks.- Spiking Neural P Systems Used as Acceptors and Transducers.- Linear-Time Model Checking: Automata Theory in Practice.- OpenFst: A General and Efficient Weighted Finite-State Transducer Library.- Automata Applications in Chip-Design Software.- Contributed Talks.- Synchronizing Automata Preserving a Chain of Partial Orders.- Reducing Acyclic Cover Transducers.- On-the-Fly Stuttering in the Construction of Deterministic ?-Automata.- Average Value and Variance of Pattern Statistics in Rational Models.- Weighted Automata and Weighted Logics with Discounting.- Regulated Nondeterminism in Pushdown Automata.- Deterministic Caterpillar Expressions.- Backward and Forward Bisimulation Minimisation of Tree Automata.- An Implementation of Deterministic Tree Automata Minimization.- Accelerating Boyer Moore Searches on Binary Texts.- On the Suffix Automaton with Mismatches.- On String Matching in Chunked Texts.- Factor Automata of Automata and Applications.- Subset Seed Automaton.- A Measure for the Degree of Nondeterminism of Context-Free Languages.- Efficient Computation of Throughput Values of Context-Free Languages.- Analyzing Ambiguity of Context-Free Grammars.- Efficient Enumeration of Regular Languages.- Multi-grain Relations.- Memory Reduction for Strategies in Infinite Games.- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms.- Finite State Automata Representing Two-Dimensional Subshifts.- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages.- Poster Abstracts.- REGAL: A Library to Randomly and Exhaustively Generate Automata.- A Finite-State Super-Chunker.- The Constrained Longest Common Subsequence Problem for Degenerate Strings.- Finite Automata Accepting Star-Connected Languages.- Efficiently Matching with Local Grammars Using Prefix Overlay Transducers.- Significant Subpatterns Matching.- A New Method for Compiling Parallel Replacement Rules.