LEADER 03831nam  2200565 a 450 
001 9910484505103321
005 20241005001158.0
010   $a3-540-37214-8
024 7 $a10.1007/11812128
035   $a(CKB)1000000000233066
035   $a(SSID)ssj0000318213
035   $a(PQKBManifestationID)11226174
035   $a(PQKBTitleCode)TC0000318213
035   $a(PQKBWorkID)10307957
035   $a(PQKB)10670212
035   $a(DE-He213)978-3-540-37214-1
035   $a(MiAaPQ)EBC3068024
035   $a(PPN)123137217
035   $a(EXLCZ)991000000000233066
100   $a20060630d2006      uy         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aImplementation and application of automata $e11th international conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006 : proceedings /$fOscar H. Ibarra, Hsu-Chun Yen (eds.)
205   $a1st ed. 2006.
210   $aBerlin $cSpringer$dc2006
215   $a1 online resource (XIII, 291 p.)
225 1 $aLecture notes in computer science,$x0302-9743 ;$v4094
225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-37213-X 
320   $aIncludes bibliographical references and index.
327   $aInvited 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.
410  0$aLecture notes in computer science ;$v4094.
410  0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues.
517 3 $aCIAA 2006
606   $aMachine theory$vCongresses
615  0$aMachine theory
676   $a004
701   $aIbarra$b Oscar H$01752947
701   $aYen$b Hsu-Chun$f1958-$01731897
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910484505103321
996   $aImplementation and application of automata$94188457
997   $aUNINA