default search action
10th CIAA 2005: Sophia Antipolis, France
- Jacques Farré, Igor Litovsky, Sylvain Schmitz:
Implementation and Application of Automata, 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3845, Springer 2006, ISBN 3-540-31023-1
Invited Lectures
- Rusins Freivalds:
Languages Recognizable by Quantum Finite Automata. 1-14 - Jacques Sakarovitch:
The Language, the Expression, and the (Small) Automaton. 15-30
Technical Contributions
- Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Marcus Nilsson:
Minimization of Non-deterministic Automata with Large Alphabets. 31-42 - Marcella Anselmo, Maria Madonia:
Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata . 43-53 - Arnaud Bailly, Mireille Clerbout, Isabelle Simplot-Ryl:
Component Composition Preserving Behavioural Contracts Based on Communication Traces. 54-65 - Miklós Bartha:
Strong Retiming Equivalence of Synchronous Schemes. 66-77 - Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Prime Normal Form and Equivalence of Simple Grammars. 78-89 - Cezar Câmpeanu
, Andrei Paun, Jason R. Smith:
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. 90-103 - Antonio Cano, Pedro García:
Finite Automata and Unions of Regular Patterns with Bounded Constant Segments. 104-115 - Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet, Jacques Sakarovitch:
Inside Vaucanson. 116-128 - Akio Fujiyoshi, Ikuo Kawaharada:
Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton. 129-140 - Yo-Sub Han, Derick Wood:
Shorter Regular Expressions from Finite-State Automata. 141-152 - Johanna Högberg:
Wind in the Willows - Generating Music by Means of Tree Transducers. 153-162 - Oscar H. Ibarra, Hsu-Chun Yen:
On Deterministic Catalytic Systems. 163-175 - Tomasz Jurdzinski, Friedrich Otto:
Restricting the Use of Auxiliary Symbols for Restarting Automata. 176-187 - André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart
A Class of Rational n-WFSM Auto-intersections. 188-198 - Joachim Klein
Experiments with Deterministic omega-Automata for Formulas of Linear Temporal Logic. 199-212 - Louis Latour:
Computing Affine Hulls over Q and Z from Sets Represented by Number Decision Diagrams. 213-224 - Markus Lohrey, Sebastian Maneth:
Tree Automata and XPath on Compressed Trees. 225-237 - Radek Pelánek, Jan Strejcek:
Deeper Connections Between LTL and Alternating Automata. 238-249 - Wojciech Rytter:
The Structure of Subword Graphs and Suffix Trees of Fibonacci Words. 250-261 - Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier:
Observations on Determinization of Büchi Automata. 262-272 - Tamara Shcherbak:
The Interval Rank of Monotonic Automata. 273-281 - Hariharan Subramanian, Priti Shankar:
Compressing XML Documents Using Recursive Finite State Automata. 282-293 - Tadahiro Suda, Haruo Hosoya:
Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment. 294-306 - Hellis Tamm
Size Reduction of Multitape Automata. 307-318 - Manuel Vilares Ferro, Juan Otero Pombo, Jesús Vilares Ferro
Robust Spelling Correction. 319-328 - Jan Zdárek, Borivoj Melichar:
On Two-Dimensional Pattern Matching by Finite Automata. 329-340
Poster Abstracts
- Jan Daciuk, Denis Maurel, Agata Savary:
Incremental and Semi-incremental Construction of Pseudo-Minimal Automata. 341-342 - Pedro García, José Ruiz, Antonio Cano, Gloria Inés Alvarez:
Is Learning RFSAs Better Than Learning DFAs?. 343-344 - Colin de la Higuera, Frédéric Piat, Frédéric Tantini:
Learning Stochastic Finite Automata for Musical Style Recognition. 345-346 - Miklós Krész
Simulation of Soliton Circuits. 347-348 - José João Morais, Nelma Moreira
Acyclic Automata with Easy-to-Find Short Regular Expressions. 349-350 - Rimma I. Podlovchenko, Dmitry M. Rusakov, Vladimir A. Zakharov:
On the Equivalence Problem for Programs with Mode Switching. 351-352 - Isabelle Tellier:
Automata and AB-Categorial Grammars. 353-355 - Michael Vielhaber, Mónica del Pilar Canales Chacon:
On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set. 356-357
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 2024-12-27 21:33 CET 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: