LEADER 06058nam 22007815 450 001 9910144027103321 005 20200706221822.0 010 $a3-540-45089-0 010 $a1-4175-6477-6 024 7 $a10.1007/3-540-45089-0 035 $a(CKB)1000000000212112 035 $a(DE-He213)978-3-540-45089-4 035 $a(SSID)ssj0000177138 035 $a(PQKBManifestationID)11177904 035 $a(PQKBTitleCode)TC0000177138 035 $a(PQKBWorkID)10209328 035 $a(PQKB)11479987 035 $a(MiAaPQ)EBC3072137 035 $a(PPN)155167618 035 $a(EXLCZ)991000000000212112 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aImplementation and Application of Automata $e8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings /$fedited by Oscar H. Ibarra, Zhe Dang 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XI, 312 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2759 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-40561-5 327 $aInvited Lectures -- Automata for Specifying Component Interfaces -- Automata on Words -- Regular Papers -- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications -- Timing Parameter Characterization of Real-Time Systems -- Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata -- From Regular Weighted Expressions to Finite Automata -- Bideterministic Automata and Minimal Representations of Regular Languages -- Succinct Descriptions of Regular Languages with Binary ?-NFAs -- An Efficient Pre-determinization Algorithm -- Introducing Vaucanson -- WFSC ? A New Weighted Finite State Compiler -- Ternary Directed Acyclic Word Graphs -- Running Time Complexity of Printing an Acyclic Automaton -- Reducing the Time Complexity of Testing for Local Threshold Testability -- Branching Automata with Costs ? A Way of Reflecting Parallelism in Costs -- New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations -- TCTL Inevitability Analysis of Dense-Time Systems -- Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services -- Boolean Operations for Attribute-Element Constraints -- XML Schema Containment Checking Based on Semi-implicit Techniques -- Weak Minimization of DFA ? An Algorithm and Applications -- Bag Automata and Stochastic Retrieval of Biomolecules in Solution -- An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics -- Robust Parsing Using Dynamic Programming -- LR Parsing for Global Index Languages (GILs) -- The Ehrenfeucht-Mycielski Sequence -- Poster Paper -- The Longest Common Subsequence Problem A Finite Automata Approach -- AVA: An Applet for Visualizing FRACTRAN and Other Automata -- Preliminary Experiments in Hardcoding Finite Automata -- Computational Linguistic Motivations for a Finite-State Machine Hierarchy -- The Effect of Rewriting Regular Expressions on Their Accepting Automata -- Building Context-Sensitive Parsers from CF Grammars with Regular Control Language -- Finite-State Molecular Computing. 330 $aAutomata theory is the foundation of computer science. Its applications have spread to almost all areas of computer science and many other disciplines. In addition, there is a growing number of software systems designed to manipulate automata, regular expressions, grammars, and related structures. This volume contains 24 regular papers from the 8th International Conference on Implementation and Application of Automata (CIAA 2003) held in Santa Barbara, CA, USA, in July 2003 covering various topics in the theory, implementation, and application of automata and related structures. It also includes the abstracts of two invited lectures as well as the abstracts of the poster papers displayed during the conference. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2759 606 $aArtificial intelligence 606 $aComputers 606 $aComputer science 606 $aAlgorithms 606 $aComputer logic 606 $aMathematical logic 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 $aComputer Science, general$3https://scigraph.springernature.com/ontologies/product-market-codes/I00001 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$aComputer science. 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aMathematical logic. 615 14$aArtificial Intelligence. 615 24$aComputation by Abstract Devices. 615 24$aComputer Science, general. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 676 $a004.0151 702 $aIbarra$b Oscar H$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDang$b Zhe$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aCIAA 2003 906 $aBOOK 912 $a9910144027103321 996 $aImplementation and Application of Automata$93552118 997 $aUNINA