Technical Program

Monday, August 21
8:00-8:45 Registration
8:45-9:00 Opening
9:00-10:00
Chair: Oscar H. Ibarra
  • Ming Li (Waterloo, Canada)
    Invited Lecture: Information Distance and Its Applications (abstract)
10:00-10:30 Coffee break
10:30-12:00
Chair: Kai Salomaa
  1. Path-equivalent Removals of Epsilon-transitions in a Genomic Weighted Finite Automaton (abstract)
    Mathieu Giraud, Philippe Veber, Dominique Lavenier
  2. Hybrid Extended Finite Automata (abstract)
    Henning Bordihn, Markus Holzer, Martin Kutrib
  3. Refinement of Near Random Access Video Coding with Weighted Finite Automata (abstract)
    German Tischler
12:00-1:30 Lunch
1:30-3:00
Chair: Ming Li
  1. Borders and Finite Automata (abstract)
    Martin Simunek, Borivoj Melichar
  2. Finding Common Motifs with Gaps using Finite Automata (abstract)
    Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo
  3. Factor Oracles (abstract)
    Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
3:00- 3:30 Coffee break
3:30- 5:00
Chair: Lucian Ilie
  1. Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice (abstract)
    Cedric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
  2. Tiburon: A Weighted Tree Automata Toolkit (abstract)
    Jonathan May, Kevin Knight
  3. Around Hopcroft's Algorithm (abstract)
    Manuel Baclet, Claire Pagetti
5:00 - 6:00
Chair: Farn Wang
Poster Session (list)
6:15 Welcoming Reception (Garden Cafeteria, Howard International House)
Tuesday, August 22
8:30-9:00 Registration
9:00-10:00
Chair: Hsu-Chun Yen
  • Sheng Yu (London, Canada)
    Invited Lecture: On the State Complexity of Combined Operations (abstract)
10:00-10:30 Coffee break
10:30-12:30
Chair: Masami Ito
  1. Multi-tape Automata with Symbol Classes (abstract)
    Florent Nicart, Jean-Marc Champarnaud, Tibor Cs\'aki, Tamas Gaal, Andre Kempe
  2. On the Computation of Some Standard Distances between Probabilistic Automata (abstract)
    Corinna Cortes, Mehryar Mohri, Ashish Rastogi
  3. Does o-Substitution Preserve Recognizability? (abstract)
    Andreas Maletti
  4. Correctness Preservation and Complexity of Simple RL-Automata (abstract)
    Hartmut Messerschmidt, Frantisek Mraz, Friedrich Otto, Martin Platek
12:30-12:45 Short break
12:45-7:00 Lunch & Excursion
7:00 Banquet (Orchid Room, Brother Hotel)
Wednesday, August 23
9:00-10:30
Chair: Sheng Yu
  1. Minimization of Tree Automata (abstract)
    Parosh Aziz Abdulla, Johanna Hogberg, Lisa Kaati
  2. Forgetting Automata and Unary Languages (abstract)
    Jens Gloeckler
  3. Structurally Unambiguous Finite Automata (abstract)
    Hing Leung
10:30-11:00 Coffee Break
11:00-12:30
Chair: Hing Leung
  1. Symbolic Implementation of Alternating Automata (abstract)
    Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, Simone Semprini
  2. On-the-fly Branching Bisimulation Minimization for Compositional Analysis (abstract)
    Yung-Pin Cheng, Hong-Yi Wang, Yu-Ru Cheng
  3. Finite-state Temporal Projection (abstract)
    Tim Fernando
12:30-2:00 Lunch
2:00- 3:30
Chair :Jan Holub
  1. A Family of Algorithms for Nondeterministic Regular Languages Inference (abstract)
    Manuel Vazquez de Parga, Pedro Garcia, Jose Ruiz
  2. Compiling Linguistic Constraints into Finite State Automata (abstract)
    Matthieu Constant, Denis Maurel
  3. Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (abstract)
    Jose Fortes Galvez, Sylvain Schmitz, Jacques Farre
3:30- 4:00 Coffee break
4:00- Best paper award and information concerning future CIAAs