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

Corporate Author: SpringerLink (Online service)
Other Authors: Champarnaud, Jean-Marc (Editor), Maurel, Denis (Editor)
Format: eBook
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2003, 2003
Edition:1st ed. 2003
Series:Lecture Notes in Computer Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • 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