Implementation and Application of Automata: 7th International Conference, CIAA 2002 Tours, France, July 3–5, 2002 Revised Papers
Author: Jean-Marc Champarnaud, Denis Maurel
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-40391-3
DOI: 10.1007/3-540-44977-9

Table of Contents:

• Edit-Distance of Weighted Automata
  
• 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