7. CIAA 2002: Tours, France

@proceedings{DBLP:conf/wia/2002,
  editor    = {Jean-Marc Champarnaud and
               Denis Maurel},
  title     = {Implementation and Application of Automata, 7th International
               Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised
               Papers},
  booktitle = {CIAA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2608},
  year      = {2003},
  isbn      = {3-540-40391-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Mehryar Mohri:
  Edit-Distance of Weighted Automata. 1-23
  Electronic Edition (link) BibTeX
• Cyril Allauzen, Mehryar Mohri:
  p-Subsequentiable Transducers. 24-34
  Electronic Edition (link) BibTeX
• Miguel A. Alonso, Víctor J. Díaz, Manuel Vilares Ferro:
  Tabulation of Bidirectional Push Down Automata. 35-46
  Electronic Edition (link) BibTeX
• Marcella Anselmo, Dora Giammarresi, Stefano Varricchio:
  Finite Automata and Non-self-Embedding Grammars. 47-56
  Electronic Edition (link) BibTeX
• Janusz A. Brzozowski, Mihaela Gheorghiu:
  Simulation of Gate Circuits in the Algebra of Transients. 57-66
  Electronic Edition (link) BibTeX
• Cezar Câmpeanu, Andrei Paun:
  The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. 67-76
  Electronic Edition (link) BibTeX
• Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
  Regex and Extended Regex. 77-84
  Electronic Edition (link) BibTeX
• Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter:
  Prime Decompositions of Regular Prefix Codes. 85-94
  Electronic Edition (link) BibTeX
• Abolfazl Fatholahzadeh:
  Implementation of Dictionaries via Automata and Decision Trees. 95-105
  Electronic Edition (link) BibTeX
• Mihaela Gheorghiu, Janusz A. Brzozowski:
  Feedback-Free Circuits in the Algebra of Transients. 106-116
  Electronic Edition (link) BibTeX
• Heiko Körner:
  On Minimizing Cover Automata for Finite Languages in O(n log n) Time. 117-127
  Electronic Edition (link) BibTeX
• Jorge Graña, Gloria Andrade, Jesús Vilares:
  Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers. 128-137
  Electronic Edition (link) BibTeX
• Franck Guingne, Florent Nicart:
  Finite State Lazy Operations in NLP. 138-147
  Electronic Edition (link) BibTeX
• Markus Holzer, Martin Kutrib:
  State Complexity of Basic Operations on Nondeterministic Finite Automata. 148-157
  Electronic Edition (link) BibTeX
• João José Neto, César Bravo:
  Adaptive Automata - A Revisited Proposal. 158-168
  Electronic Edition (link) BibTeX
• Alexander Okhotin:
  Efficient Automaton-Based Recognition for Linear Conjunctive Languages. 169-181
  Electronic Edition (link) BibTeX
• Libor Polák:
  Syntactic Semiring and Language Equations. 182-193
  Electronic Edition (link) BibTeX
• Klaus Sutner:
  Reduced Power Automata. 194-202
  Electronic Edition (link) BibTeX
• A. N. Trahtman:
  A Polynomial Time Algorithm for Left [Right] Local Testability. 203-212
  Electronic Edition (link) BibTeX
• Alexander Okhotin:
  Whale Calf, a Parser Generator for Conjunctive Grammars. 213-220
  Electronic Edition (link) BibTeX
• Klaus Sutner:
  automata, a Hybrid System for Computational Automata Theory. 221-227
  Electronic Edition (link) BibTeX
• A. N. Trahtman:
  A Package TESTAS for Checking Some Kinds of Testability. 228-232
  Electronic Edition (link) BibTeX
• Miroslav Balík:
  DAWG versus Suffix Array. 233-238
  Electronic Edition (link) BibTeX
• Anne Brüggemann-Klein, Derick Wood:
  On Predictive Parsing and Extended Context-Free Grammars. 239-247
  Electronic Edition (link) BibTeX
• Pascal Caron, Marianne Flouret:
  Star Normal Form, Rational Expressions, and Glushkov WFAs Properties. 248-254
  Electronic Edition (link) BibTeX
• Jan Daciuk:
  Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings. 255-261
  Electronic Edition (link) BibTeX
• Gaëlle Largeteau, Dominique Geniet:
  Term Validation of Distributed Hard Real-Time Applications. 262-269
  Electronic Edition (link) BibTeX
• Zdenek Tronícek:
  Common Subsequence Automaton. 270-275
  Electronic Edition (link) BibTeX
• Manuel Vilares Ferro, Victor M. Darriba, Miguel A. Alonso:
  Searching for Asymptotic Error Repair. 276-281
  Electronic Edition (link) BibTeX
• Constantinos Bartzis, Tevfik Bultan:
  Automata-Based Representations for Arithmetic Constraints in Automated Verification. 282-288
  Electronic Edition (link) BibTeX
• Jan Holub, Maxime Crochemore:
  On the Implementation of Compact DAWG's. 289-294
  Electronic Edition (link) BibTeX
• Jan Holub:
  Dynamic Programming - NFA Simulation. 295-300
  Electronic Edition (link) BibTeX
• Borivoj Melichar:
  Deterministic Parsing of Cyclic Strings. 301-306
  Electronic Edition (link) BibTeX