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