Implementation and Application of Automata 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Champarnaud, Jean-Marc (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Maurel, Denis (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2608
• Θέματα: Artificial 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.

Πίνακας περιεχομένων:

• 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.