LEADER 05780nam 22008175 450 001 9910143877903321 005 20251116234253.0 010 $a3-540-44977-9 024 7 $a10.1007/3-540-44977-9 035 $a(CKB)1000000000211939 035 $a(SSID)ssj0000323917 035 $a(PQKBManifestationID)11237089 035 $a(PQKBTitleCode)TC0000323917 035 $a(PQKBWorkID)10303307 035 $a(PQKB)11425615 035 $a(DE-He213)978-3-540-44977-5 035 $a(MiAaPQ)EBC3073189 035 $a(PPN)155199528 035 $a(Association for Computing Machinery)10.5555/1756384 035 $a(BIP)13627327 035 $a(BIP)8789498 035 $a(EXLCZ)991000000000211939 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aImplementation and Application of Automata $e7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers /$fedited by Jean-Marc Champarnaud, Denis Maurel 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XI, 310 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2608 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-40391-4 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Lecture -- Edit-Distance of Weighted Automata -- Technical Contributions -- p-Subsequentiable Transducers -- Bidirectional Push Down Automata -- Finite Automata and Non-self-Embedding Grammars -- Simulation of Gate Circuits in the Algebra of Transients -- The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata -- Regex and Extended Regex -- Prime Decompositions of Regular Prefix Codes -- Implementation of Dictionaries via Automata and Decision Trees -- Feedback-Free Circuits in the Algebra of Transients -- On Minimizing Cover Automata for Finite Languages in O(n log n) Time -- Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers -- Finite State Lazy Operations in NLP -- State Complexity of Basic Operations on Nondeterministic Finite Automata -- Adaptive Automata - A Revisited Proposal -- Efficient Automaton-Based Recognition for Linear Conjunctive Languages -- Syntactic Semiring and Language Equations -- Reduced Power Automata -- A Polynomial Time Algorithm for Left [Right] Local Testability -- Whale Calf, a Parser Generator for Conjunctive Grammars -- automata, a Hybrid System for Computational Automata Theory -- A Package TESTAS for Checking Some Kinds of Testability -- DAWG versus Suffix Array -- On Predictive Parsing and Extended Context-Free Grammars -- Star Normal Form, Rational Expressions, and Glushkov WFAs Properties -- Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings -- Term Validation of Distributed Hard Real-Time Applications -- Common Subsequence Automaton -- Searching for Asymptotic Error Repair -- Abstracts -- Automata-Based Representations for Arithmetic Constraints in Automated Verification -- On the Implementation of Compact DAWG?s -- Dynamic Programming ? NFA Simulation -- Deterministic Parsing of Cyclic Strings. 330 $aThe refereed post-proceedings of the 7th International Conference on Implementation and Application of Automata, CIAA 2002, held in Tours, France, in July 2002. The 28 revised full papers presented together with an invited paper and 4 short papers were carefully selected during two rounds of reviewing and revision. The topics addressed range from theoretical and methodological issues to automata applications in software engineering, natural language processing, speech recognition, and image processing, to new representations and algorithms for efficient implementation of automata and related structures. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2608 517 3 $aCIAA'02 606 $aArtificial intelligence 606 $aComputers 606 $aAlgorithms 606 $aComputer logic 606 $aLogic, Symbolic and mathematical 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aArtificial intelligence. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aLogic, Symbolic and mathematical. 615 14$aArtificial Intelligence. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 676 $a004 702 $aChamparnaud$b Jean-Marc$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMaurel$b Denis$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aCIAA 2002 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143877903321 996 $aImplementation and Application of Automata$93552118 997 $aUNINA