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.
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.
Produktdetails
Produktdetails
Theoretical Computer Science and General Issues 4094
Die Herstellerinformationen sind derzeit nicht verfügbar.
Autorenporträt
Oscar H. Ibarra, University of California, Santa Barbara, CA, USA / Hsu-Chun Yen, National Taiwan University, Taipei, Taiwan, ROC
Inhaltsangabe
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.
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.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826
