LEADER 05093nam 22008175 450 001 996465977903316 005 20230222034502.0 010 $a3-540-70844-8 024 7 $a10.1007/978-3-540-70844-5 035 $a(CKB)1000000000490654 035 $a(SSID)ssj0000355523 035 $a(PQKBManifestationID)11227490 035 $a(PQKBTitleCode)TC0000355523 035 $a(PQKBWorkID)10319709 035 $a(PQKB)11484003 035 $a(DE-He213)978-3-540-70844-5 035 $a(MiAaPQ)EBC3063115 035 $a(MiAaPQ)EBC6512606 035 $a(Au-PeEL)EBL6512606 035 $a(OCoLC)1113541699 035 $a(PPN)127055118 035 $a(EXLCZ)991000000000490654 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aImplementation and Applications of Automata$b[electronic resource] $e13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008, Proceedings /$fedited by Oscar H. Ibarra, Bala Ravikumar 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XIII, 289 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5148 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-70843-X 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- Nondeterministic Finite Automata?Recent Results on the Descriptional and Computational Complexity -- Language Decompositions, Primality, and Trajectory-Based Operations -- Automata, Probability, and Recursion -- Concurrency, Synchronization, and Conflicts in Petri Nets -- Technical Contributions -- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties -- Antimirov and Mosses?s Rewrite System Revisited -- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata -- Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) -- Hopcroft?s Minimization Technique: Queues or Stacks? -- Learning Regular Languages Using Nondeterministic Finite Automata -- Multi-Return Macro Tree Transducers -- Computing Convex Hulls by Automata Iteration -- A Translation from the HTML DTD into a Regular Hedge Grammar -- Tree-Series-to-Tree-Series Transformations -- Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning -- Pattern Matching in DCA Coded Text -- Five Determinisation Algorithms -- Persistent Computations of Turing Machines -- On Complexity of Two Dimensional Languages Generated by Transducers -- Games for Temporal Logics on Trees -- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata -- Composed Bisimulation for Tree Automata -- Hyper-Minimization in O(n 2) -- Deterministic Pushdown Automata and Unary Languages -- Finite Eilenberg Machines -- The Number of Runs in Sturmian Words -- 3-Way Composition of Weighted Finite-State Transducers -- Progressive Solutions to FSM Equations -- Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees -- Approximate Periods with Levenshtein Distance. 330 $aThis book constitutes the thoroughly refereed post-proceedings of the 13th International Conference on Implementation and Application of Automata, CIAA 2008, held in San Francisco, USA, in July 2008. The 26 revised full papers togehter with 4 invited papers were carefully reviewed and selected from 40 submissions and have gone through two rounds of reviewing and improvement. The papers cover various topics in the theory, implementation, and applications of automata and related structures. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5148 606 $aComputer science 606 $aComputer programming 606 $aCompilers (Computer programs) 606 $aAlgorithms 606 $aMachine theory 606 $aTheory of Computation 606 $aProgramming Techniques 606 $aCompilers and Interpreters 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 615 0$aComputer science. 615 0$aComputer programming. 615 0$aCompilers (Computer programs). 615 0$aAlgorithms. 615 0$aMachine theory. 615 14$aTheory of Computation. 615 24$aProgramming Techniques. 615 24$aCompilers and Interpreters. 615 24$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 676 $a511.3 702 $aIbarra$b Oscar H. 702 $aRavikumar$b B. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465977903316 996 $aImplementation and Applications of Automata$9774375 997 $aUNISA