default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th CIAA 2002: Tours, France
- Jean-Marc Champarnaud, Denis Maurel:
Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers. Lecture Notes in Computer Science 2608, Springer 2003, ISBN 3-540-40391-4 - Mehryar Mohri:
Edit-Distance of Weighted Automata. 1-23 - Cyril Allauzen, Mehryar Mohri:
p-Subsequentiable Transducers. 24-34 - Miguel A. Alonso, Víctor J. Díaz, Manuel Vilares Ferro:
Tabulation of Bidirectional Push Down Automata. 35-46 - Marcella Anselmo, Dora Giammarresi, Stefano Varricchio:
Finite Automata and Non-self-Embedding Grammars. 47-56 - Janusz A. Brzozowski, Mihaela Gheorghiu:
Simulation of Gate Circuits in the Algebra of Transients. 57-66 - Cezar Câmpeanu
, Andrei Paun:
The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. 67-76 - Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
Regex and Extended Regex. 77-84 - Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter:
Prime Decompositions of Regular Prefix Codes. 85-94 - Abolfazl Fatholahzadeh:
Implementation of Dictionaries via Automata and Decision Trees. 95-105 - Mihaela Gheorghiu, Janusz A. Brzozowski:
Feedback-Free Circuits in the Algebra of Transients. 106-116 - Heiko Körner:
On Minimizing Cover Automata for Finite Languages in O(n log n) Time. 117-127 - 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 - Franck Guingne, Florent Nicart:
Finite State Lazy Operations in NLP. 138-147 - Markus Holzer, Martin Kutrib:
State Complexity of Basic Operations on Nondeterministic Finite Automata. 148-157 - João José Neto, César Bravo:
Adaptive Automata - A Revisited Proposal. 158-168 - Alexander Okhotin:
Efficient Automaton-Based Recognition for Linear Conjunctive Languages. 169-181 - Libor Polák:
Syntactic Semiring and Language Equations. 182-193 - Klaus Sutner:
Reduced Power Automata. 194-202 - A. N. Trahtman:
A Polynomial Time Algorithm for Left [Right] Local Testability. 203-212 - Alexander Okhotin:
Whale Calf, a Parser Generator for Conjunctive Grammars. 213-220 - Klaus Sutner:
automata, a Hybrid System for Computational Automata Theory. 221-227 - A. N. Trahtman:
A Package TESTAS for Checking Some Kinds of Testability. 228-232 - Miroslav Balík:
DAWG versus Suffix Array. 233-238 - Anne Brüggemann-Klein, Derick Wood:
On Predictive Parsing and Extended Context-Free Grammars. 239-247 - Pascal Caron, Marianne Flouret:
Star Normal Form, Rational Expressions, and Glushkov WFAs Properties. 248-254 - Jan Daciuk:
Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings. 255-261 - Gaëlle Largeteau, Dominique Geniet:
Term Validation of Distributed Hard Real-Time Applications. 262-269 - Zdenek Tronícek:
Common Subsequence Automaton. 270-275 - Manuel Vilares Ferro, Victor M. Darriba, Miguel A. Alonso:
Searching for Asymptotic Error Repair. 276-281 - Constantinos Bartzis, Tevfik Bultan:
Automata-Based Representations for Arithmetic Constraints in Automated Verification. 282-288 - Jan Holub, Maxime Crochemore:
On the Implementation of Compact DAWG's. 289-294 - Jan Holub:
Dynamic Programming - NFA Simulation. 295-300 - Borivoj Melichar:
Deterministic Parsing of Cyclic Strings. 301-306
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-22 02:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
