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

Sommario

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 ofCompact DAWG's.- Dynamic Programming - NFA Simulation.- Deterministic Parsing of Cyclic Strings.

Dettagli sul prodotto

• Con la collaborazione di: Jean-Marc Champarnaud (Editore), Denis Maurel (Editore)
• Editore: Springer, Berlin
• Lingue: Inglese
• Formato: Tascabile
• Pubblicazione: 23.06.2003
• EAN: 9783540403913
• ISBN: 978-3-540-40391-3
• Pagine: 310
• Peso: 458 g
• Illustrazioni: XI, 310 p.
• Serie: Lecture Notes in Computer Science
• Categorie: Scienze naturali, medicina, informatica, tecnica > Informatica, EDP > Informatica; C, Algorithmen und Datenstrukturen, Algorithms, Artificial Intelligence, Theoretische Informatik, computer science, Theory of Computation, Logics and Meanings of Programs, Computers, Algorithms & data structures, Mathematical theory of computation, Computer programming / software engineering, Algorithm Analysis and Problem Complexity, Mathematical logic, Mathematical Logic and Formal Languages, Computer architecture & logic design, Computer logic, Computation by Abstract Devices, Computer Science Logic and Foundations of Programming, Formal Languages and Automata Theory