LEADER 04277nam 2200589 a 450 001 9910483253003321 005 20200520144314.0 010 $a1-282-29795-3 010 $a9786612297953 010 $a3-642-02979-5 024 7 $a10.1007/978-3-642-02979-0 035 $a(CKB)1000000000761256 035 $a(SSID)ssj0000299392 035 $a(PQKBManifestationID)11254056 035 $a(PQKBTitleCode)TC0000299392 035 $a(PQKBWorkID)10240816 035 $a(PQKB)11569665 035 $a(DE-He213)978-3-642-02979-0 035 $a(MiAaPQ)EBC3068698 035 $a(PPN)136310680 035 $a(EXLCZ)991000000000761256 100 $a20120314d2009 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aImplementation and application of automata $e14th international conference, CIAA 2009, Sydney, Australia, July 14-17, 2009 : proceedings /$fSebastian Maneth (ed.) 205 $a1st ed. 2009. 210 $aBerlin $cSpringer$d2009 215 $a1 online resource (XI, 263 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v5642 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-02978-7 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- Implementation and Application of Automata in String Processing -- Applications of Automata in XML Processing -- Program Analysis through Finite Tree Automata -- Technical Contributions -- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton -- On Extremal Cases of Hopcroft?s Algorithm -- Compact Normal Form for Regular Languages as Xor Automata -- Cellular Automata with Sparse Communication -- A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule -- On Parallel Implementations of Deterministic Finite Automata -- FAdo and GUItar -- A Testing Framework for Finite-State Morphology -- A Table Compression Method for Extended Aho-Corasick Automaton -- Compact Representation for Answer Sets of n-ary Regular Queries -- Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata -- Random Generation of Deterministic Tree (Walking) Automata -- Hedge Pattern Partial Derivative -- TAGED Approximations for Temporal Properties Model-Checking -- Verifying Parallel Programs with Dynamic Communication Structures -- Fixpoint Guided Abstraction Refinement for Alternating Automata -- Automata-Based Termination Proofs -- Implementation of State Elimination Using Heuristics -- Short Regular Expressions from Finite Automata: Empirical Results -- Small Extended Expressions for Acyclic Automata -- Quantum Queries on Permutations with a Promise -- Time-Optimal Winning Strategies for Poset Games -- Amount of Nonconstructivity in Finite Automata -- Short Papers and Poster Abstracts -- Multiflex: A Multilingual Finite-State Tool for Multi-Word Units -- Efficient Parsing Using Filtered-Popping Recursive Transition Networks -- Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms -- Formally Synthesising a Protocol Converter: A Case Study -- Compiler Generator Based on Restarting Automata -- Are Statecharts Finite Automata?. 330 $aThis book constitutes the thoroughly refereed papers of the 14th International Conference on Implementation and Application of Automata, CIAA 2009, held in Sydney, Austrialia, in July 2009. The 23 revised full papers togehter with 6 short papers were carefully selected from 42 submissions. The papers cover various topics in the theory, implementation, and applications of automata and related structures. 410 0$aLecture notes in computer science ;$v5642. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 517 3 $aCIAA 2009 606 $aMachine theory$vCongresses 615 0$aMachine theory 676 $a005.11 701 $aManeth$b Sebastian$01757416 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483253003321 996 $aImplementation and application of automata$94195249 997 $aUNINA