03832nam 2200565 a 450 991048450510332120200520144314.03-540-37214-810.1007/11812128(CKB)1000000000233066(SSID)ssj0000318213(PQKBManifestationID)11226174(PQKBTitleCode)TC0000318213(PQKBWorkID)10307957(PQKB)10670212(DE-He213)978-3-540-37214-1(MiAaPQ)EBC3068024(PPN)123137217(EXLCZ)99100000000023306620060630d2006 uy 0engurnn|008mamaatxtccrImplementation and application of automata 11th international conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006 : proceedings /Oscar H. Ibarra, Hsu-Chun Yen (eds.)1st ed. 2006.Berlin Springerc20061 online resource (XIII, 291 p.) Lecture notes in computer science,0302-9743 ;4094LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic Level Mode of Issuance: Monograph3-540-37213-X Includes bibliographical references and index.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 Compiled from a Single Regular Expression -- Tighter Packed Bit-Parallel NFA for Approximate String Matching.Lecture notes in computer science ;4094.LNCS sublibrary.SL 1,Theoretical computer science and general issues.CIAA 2006Machine theoryCongressesMachine theory004Ibarra Oscar H1752947Yen Hsu-Chun1958-1731897MiAaPQMiAaPQMiAaPQBOOK9910484505103321Implementation and application of automata4188457UNINA