05066nam 22007815 450 991014387790332120200705230006.03-540-44977-910.1007/3-540-44977-9(CKB)1000000000211939(SSID)ssj0000323917(PQKBManifestationID)11237089(PQKBTitleCode)TC0000323917(PQKBWorkID)10303307(PQKB)11425615(DE-He213)978-3-540-44977-5(MiAaPQ)EBC3073189(PPN)155199528(Association for Computing Machinery)10.5555/1756384(EXLCZ)99100000000021193920121227d2003 u| 0engurnn|008mamaatxtccrImplementation and Application of Automata 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers /edited by Jean-Marc Champarnaud, Denis Maurel1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (XI, 310 p.) Lecture Notes in Computer Science,0302-9743 ;2608Bibliographic Level Mode of Issuance: Monograph3-540-40391-4 Includes bibliographical references at the end of each chapters and index.Invited 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.Lecture Notes in Computer Science,0302-9743 ;2608CIAA'02Artificial intelligenceComputersAlgorithmsComputer logicMathematical logicArtificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Artificial intelligence.Computers.Algorithms.Computer logic.Mathematical logic.Artificial Intelligence.Computation by Abstract Devices.Algorithm Analysis and Problem Complexity.Logics and Meanings of Programs.Mathematical Logic and Formal Languages.004Champarnaud Jean-Marcedthttp://id.loc.gov/vocabulary/relators/edtMaurel Denisedthttp://id.loc.gov/vocabulary/relators/edtCIAA 2002MiAaPQMiAaPQMiAaPQBOOK9910143877903321Implementation and Application of Automata3552118UNINA