Program

Tuesday, July 14th, 2009

9:00 - 10:00
Invited Talk
Gonzalo Navarro - Implementation and Application of Automata in String Processing

10:30 - 12:00
Minimization
Markus Holzer, Andreas Maletti - An (n log n) Algorithm for Hyper-Minimizing States in a (Minimized) Deterministic Automaton
Giusi Castiglione, Antonio Restivo, Marinella Sciortino - On Extremal Cases of the Hopcroft's Algorithm
Jean Vuillemin and Nicolas Gama - Compact Normal Form for Regular Languages as Xor Automata

1:30-3:00
FA to Regular Expression
Jae-Hee Ahn, Yo-Sub Han - Implementation of State Elimination using Heuristics
Hermann Gruber, Markus Holzer, Michael Tautschnig - Short Regular Expressions from Finite Automata: Empirical Results
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot - Small extended expressions for acyclic automata

3:30 - 5:00
Tools and Applications
Jan Holub, Stanislav Stekr - On Parallel Implementations of Deterministic Finite Automata
Andre Almeida, Marco Almeida, Jose Alves, Nelma Moreira, Rogerio Reis - FAdo and GUItar: tools for automata manipulation and visualization
Francois Barthelemy - A Testing Framework for Finite-State Morphology

5:15 - 6:15
Open Problems Session

6:15 - 7:45
Welcome Drink

Wednesday, July 15th, 2009

9:00 - 10:00
Invited Talk
Christoph Koch - Applications of Automata in XML Processing

10:30-12
Compression
Yanbing Liu, Yifu Yang, Ping Liu, Jianlong Tan - A Table Compression Method for Advanced Aho-Corasick Automaton
Kazuhiro Inaba, Haruo Hosoya - Compact Representation for Answer Sets of n-ary Regular Queries
Akio Fujiyoshi - Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata

2:00-3:30
Tree Automata
Pierre-Cyrille Heam, Cyril Nicaud, Sylvain Schmitz - Random Generation of Deterministic Tree (Walking) Automata
Taro Suzuki, Satoshi Okui - Hedge Pattern Partial Derivative
Romeo Courbis, Pierre-Cyrille Heam, Olga Kouchnarenko - TAGED Approximations for Verifying Temporal Patterns

4:00-5:30
Short Papers I
Agata Savary - Multiflex: an Multilingual Finite-State Tool for Multi-Word Units
Javier M. Sastre-Martinez - Efficient Parsing Using Filtered-Popping Recursive Transition Networks
Loek Cleophas, Kees Hemerik - Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms

Thursday, July 16th, 2009

9:00 - 10:00
Invited Talk
Helmut Seidl - Program Analysis through Finite Tree Automata

10:30-12:00
Verification
Mohamed Faouzi Atig Tayssir Touili - Verifying Parallel Programs with Dynamic Communication Structures
Pierre Ganty, Nicolas Maquet, Jean-Francois Raskin - Fixpoint Guided Abstraction Refinement for Alternating Automata
Radu Iosif, Adam Rogalewicz - Automata-based Termination Proofs

1:30 - 5:30 Excursion
7:00-10:00 Conference Dinner

Friday, July 17th, 2009

9:00-10:00
Cellular Automata
Martin Kutrib, Andreas Malcher - Cellular Automata With Sparse Communication
Adam Clarridge, Kai Salomaa - A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule

10:30-12:00
Theory
Rusins Freivalds, Kazuo Iwama - Quantum queries on permutations with a promise
Martin Zimmermann - Time-Optimal Winning Strategies for Poset Games Rusins Freivalds - Nonconstructive methods and deterministic finite automata

2:00 - 3:30
Short Papers II
Jing Cao, Albert Nymeyer - A Formal Automata-Based Architecture to Synthesise a Protocol Converter
Jan Prochazka - Compiler Generator Based on Restarting Automata
Hanlin Lu, Sheng Yu - Are Statecharts Finite Automata?

4:00 - 5:00 Business Meeting