Implementation and Application of Automata : 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings

Corporate Author: SpringerLink (Online service)
Other Authors: Ibarra, Oscar H. (Editor), Yen, Hsu-Chun (Editor)
Format: eBook
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2006, 2006
Edition:1st ed. 2006
Series:Theoretical Computer Science and General Issues
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 03341nmm a2200385 u 4500
001 EB000376646
003 EBX01000000000000000229698
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540372141 
100 1 |a Ibarra, Oscar H.  |e [editor] 
245 0 0 |a Implementation and Application of Automata  |h Elektronische Ressource  |b 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings  |c edited by Oscar H. Ibarra, Hsu-Chun Yen 
250 |a 1st ed. 2006 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2006, 2006 
300 |a XIII, 291 p  |b online resource 
505 0 |a 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 
653 |a Computation by Abstract Devices 
653 |a Mathematical Logic and Formal Languages 
653 |a Mathematical logic 
653 |a Algorithms 
653 |a Computers 
653 |a Artificial Intelligence 
653 |a Artificial intelligence 
653 |a Algorithm Analysis and Problem Complexity 
653 |a Logics and Meanings of Programs 
653 |a Computer logic 
700 1 |a Yen, Hsu-Chun  |e [editor] 
710 2 |a SpringerLink (Online service) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Theoretical Computer Science and General Issues 
856 |u  |x Verlag  |3 Volltext 
082 0 |a 006.3