Implementation and Application of Automata

11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings

Oscar H. Ibarra, Hsu-Chun Yen (Herausgeber)

Buch | Softcover

XIII, 291 Seiten

2006 | 2006
Springer Berlin (Verlag)
978-3-540-37213-4 (ISBN)

Artikel merken

lt;p>This book constitutes the refereed proceedings of the 11th International Conference on Implementation and Application of Automata, CIAA 2006, held in Taipei, Taiwan, in August 2006. The 22 revised full papers and 7 revised poster papers presented together with the extended abstracts of 3 invited lectures were carefully reviewed and selected from 76 submissions. The papers cover various topics in the theory, implementation, and applications of automata and related structures.

Invited Lectures.- Information Distance and Its Applications.- Theory Inspired by Gene Assembly in Ciliates.- On the State Complexity of Combined Operations.- Technical Contributions.- Path-Equivalent Removals of ?-transitions in a Genomic Weighted Finite Automaton.- Hybrid Extended Finite Automata.- Refinement of Near Random Access Video Coding with Weighted Finite Automata.- Borders and Finite Automata.- Finding Common Motifs with Gaps Using Finite Automata.- Factor Oracles.- Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice.- Tiburon: A Weighted Tree Automata Toolkit.- Around Hopcroft's Algorithm.- Multi-tape Automata with Symbol Classes.- On the Computation of Some Standard Distances Between Probabilistic Automata.- Does o-Substitution Preserve Recognizability?.- Correctness Preservation and Complexity of Simple RL-Automata.- Bisimulation Minimization of Tree Automata.- Forgetting Automata and Unary Languages.- Structurally Unambiguous Finite Automata.- Symbolic Implementation of Alternating Automata.- On-the-Fly Branching Bisimulation Minimization for Compositional Analysis.- Finite-State Temporal Projection.- Compiling Linguistic Constraints into Finite State Automata.- Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time.- A Family of Algorithms for Non Deterministic Regular Languages Inference.- Poster Abstracts.- XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof.- A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems.- Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits.- Reachability Analysis of Procedural Programs with Affine Integer Arithmetic.- Lexical Disambiguation with Polarities and Automata.- Parsing Computer Languages with an Automaton Compiledfrom a Single Regular Expression.- Tighter Packed Bit-Parallel NFA for Approximate String Matching.

Erscheint lt. Verlag	10.8.2006
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XIII, 291 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	471 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	Algorithm analysis and problem complexity • algorithms • Automata • automata implementations • Automata Theory • Complexity • Complexity theory • Finite Automata • Finite-State Systems • formal methods • Foundations • Genome • grammar systems • Model Checking • Natural Language Processing • Pattern Matching • probabilistic automata • Regular Expressions • regular languages • Simulation • Tree automata • XML processing
ISBN-10	3-540-37213-X / 354037213X
ISBN-13	978-3-540-37213-4 / 9783540372134
Zustand	Neuware