Implementation and Application of Automata
Subtitle: 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers (Lecture Notes in Computer Science)
Contributors: Jean-Marc Champarnaud (Editor); Denis Maurel (Editor)
Edition: 1 edition
Publisher: Springer
Published: August 13, 2003
Language: eng
Format: Paperback
Number of pages: 307
ISBN-13: 9783540403913
Subjects: Artificial intelligence; General; Computer Science; Computers; Computers - General Information; Computer Books: General; Machine theory; Logic; Logic Design; Computers / Computer Science; automata; automata computations; automata theory; cellular automata; formal languages; formal methods; foundations; grammar systems; implementations; Congresses
First sentence: The edit-distance of two strings is the minimal cost of a sequence of symbol insertions, deletions, or substitutions transforming one string into the other [18].
Description: Implementation and Application of Automata: 7th International Conference, CIAA 2002 Tours, France, July 3–5, 2002 Revised Papers<br />Author: Jean-Marc Champarnaud, Denis Maurel<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-40391-3<br /> DOI: 10.1007/3-540-44977-9<br /><br />Table of Contents:<p></p><ul><li>Edit-Distance of Weighted Automata
</li><li>p-Subsequentiable Transducers
</li><li>Bidirectional Push Down Automata
</li><li>Finite Automata and Non-self-Embedding Grammars
</li><li>Simulation of Gate Circuits in the Algebra of Transients
</li><li>The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata
</li><li>Regex and Extended Regex
</li><li>Prime Decompositions of Regular Prefix Codes
</li><li>Implementation of Dictionaries via Automata and Decision Trees
</li><li>Feedback-Free Circuits in the Algebra of Transients
</li><li>On Minimizing Cover Automata for Finite Languages in O(n log n) Time
</li><li>Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers
</li><li>Finite State Lazy Operations in NLP
</li><li>State Complexity of Basic Operations on Nondeterministic Finite Automata
</li><li>Adaptive Automata - A Revisited Proposal
</li><li>Efficient Automaton-Based Recognition for Linear Conjunctive Languages
</li><li>Syntactic Semiring and Language Equations
</li><li>Reduced Power Automata
</li><li>A Polynomial Time Algorithm for Left [Right] Local Testability
</li><li>Whale Calf, a Parser Generator for Conjunctive Grammars</li></ul>