LEADER 06924nam 22008175 450 001 996465795003316 005 20231025170854.0 010 $a3-540-44674-5 024 7 $a10.1007/3-540-44674-5 035 $a(CKB)1000000000211498 035 $a(SSID)ssj0000323916 035 $a(PQKBManifestationID)11240569 035 $a(PQKBTitleCode)TC0000323916 035 $a(PQKBWorkID)10304046 035 $a(PQKB)10265244 035 $a(DE-He213)978-3-540-44674-3 035 $a(MiAaPQ)EBC3073283 035 $a(PPN)155198491 035 $a(EXLCZ)991000000000211498 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aImplementation and Application of Automata$b[electronic resource] $e5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers /$fedited by Sheng Yu, Andrei Paun 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XI, 342 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2088 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42491-1 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Lectures -- Synthesizing State-Based Object Systems from LSC Specifications -- Applications of Finite-State Transducers in Natural Language Processing -- Technical Contributions -- Fast Implementations of Automata Computations -- Regularly Extended Two-Way Nondeterministic Tree Automata -- Glushkov Construction for Multiplicities -- Implicit Structures to Implement NFA?s from Regular Expressions -- New Finite Automaton Constructions Based on Canonical Derivatives -- Experiments with Automata Compression -- Computing Raster Images from Grid Picture Grammars -- A Basis for Looping Extensions to Discriminating-Reverse Parsing -- Automata for Pro-V Topologies -- Reachability and Safety in Queue Systems -- Generalizing the Discrete Timed Automaton -- Factorization of Ambiguous Finite-State Transducers -- MONA Implementation Secrets -- Cursors -- An Automaton Model of User-Controlled Navigation on the Web -- Direct Construction of Minimal Acyclic Subsequential Transducers -- Generic ?-Removal Algorithm for Weighted Automata -- An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages -- Unary Language Concatenation and Its State Complexity -- Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games -- State Complexity and Jacobsthal?s Function -- A Package for the Implementation of Block Codes as Finite Automata -- Regional Least-Cost Error Repair -- The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata -- Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski -- The MERLin Environment Applied to ?-NFAs -- Abstracts -- Visual Exploration of Generation Algorithms for Finite Automata on the Web -- TREEBAG -- Word Random Access Compression -- Extended Sequentialization of Transducers -- Lessons from INR in the Specification of Transductions -- Part-of-Speech Tagging with Two Sequential Transducers -- Solving Complex Problems Efficiently with Adaptive Automata. 330 $aThe Fifth International Conference on Implementation and Application of - tomata (CIAA 2000) was held at the University of Western Ontario in London, Ontario, Canada on July 24-25, 2000. This conference series was formerly called the International Workshop on Implementing Automata (WIA) This volume of the Lecture Notes in Computer Science series contains all the papers that were presented at CIAA 2000, and also the abstracts of the poster papers that were displayed during the conference. The conference addressed issues in automata application and implementation. The topics of the papers presented at this conference ranged from automata applications in software engineering, natural language and speech recognition, and image processing, to new representations and algorithms for efficient implementation of automata and related structures. Automata theory is one of the oldest areas in computer science. Research in automata theory has always been motivated by its applications since its early stages of development. In the 1960s and 1970s, automata research was motivated heavily by problems arising from compiler construction, circuit design, string matching, etc. In recent years, many new applications have been found in various areas of computer science as well as in other disciplines. Examples of the new applications include statecharts in object-oriented modeling, nite transducers in natural language processing, and nondeterministic nite-state models in communication protocols. Many of the new applications do not and cannot simply apply the existing models and algorithms in automata theory to their problems. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2088 606 $aComputer programming 606 $aArtificial intelligence 606 $aArchitecture, Computer 606 $aComputers 606 $aAlgorithms 606 $aComputer logic 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 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 615 0$aComputer programming. 615 0$aArtificial intelligence. 615 0$aArchitecture, Computer. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer logic. 615 14$aProgramming Techniques. 615 24$aArtificial Intelligence. 615 24$aComputer System Implementation. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 676 $a004 702 $aYu$b Sheng$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPaun$b Andrei$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aCIAA 2000 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465795003316 996 $aImplementation and Application of Automata$93552118 997 $aUNISA