14. CIAA 2009:
ydney,
Australia
Sebastian Maneth (Ed.):
Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings.
Lecture Notes in Computer Science 5642 Springer 2009, ISBN 978-3-642-02978-3 
Invited Lectures
- Gonzalo Navarro:
Implementation and Application of Automata in String Processing.
1
- Christoph Koch:
Applications of Automata in XML Processing.
2
- Helmut Seidl:
Program Analysis through Finite Tree Automata.
3
Technical Contributions
- Markus Holzer, Andreas Maletti:
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.
4-13
- Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
On Extremal Cases of Hopcroft's Algorithm.
14-23
- Jean Vuillemin, Nicolas Gama:
Compact Normal Form for Regular Languages as Xor Automata.
24-33
- Martin Kutrib, Andreas Malcher:
Cellular Automata with Sparse Communication.
34-43
- Adam Clarridge, Kai Salomaa:
A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule.
44-53
- Jan Holub, Stanislav Stekr:
On Parallel Implementations of Deterministic Finite Automata.
54-64
- André Almeida, Marco Almeida, José Alves, Nelma Moreira, Rogério Reis:
FAdo and GUItar.
65-74
- François Barthélemy:
A Testing Framework for Finite-State Morphology.
75-83
- Yanbing Liu, Yifu Yang, Ping Liu, Jianlong Tan:
A Table Compression Method for Extended Aho-Corasick Automaton.
84-93
- Kazuhiro Inaba, Haruo Hosoya:
Compact Representation for Answer Sets of n-ary Regular Queries.
94-104
- Akio Fujiyoshi:
Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata.
105-114
- Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz:
Random Generation of Deterministic Tree (Walking) Automata.
115-124
- Taro Suzuki, Satoshi Okui:
Hedge Pattern Partial Derivative.
125-134
- Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko:
TAGED Approximations for Temporal Properties Model-Checking.
135-144
- Mohamed Faouzi Atig, Tayssir Touili:
Verifying Parallel Programs with Dynamic Communication Structures.
145-154
- Pierre Ganty, Nicolas Maquet, Jean-François Raskin:
Fixpoint Guided Abstraction Refinement for Alternating Automata.
155-164
- Radu Iosif, Adam Rogalewicz:
Automata-Based Termination Proofs.
165-177
- Jae-Hee Ahn, Yo-Sub Han:
Implementation of State Elimination Using Heuristics.
178-187
- Hermann Gruber, Markus Holzer, Michael Tautschnig:
Short Regular Expressions from Finite Automata: Empirical Results.
188-197
- Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot:
Small Extended Expressions for Acyclic Automata.
198-207
- Rusins Freivalds, Kazuo Iwama:
Quantum Queries on Permutations with a Promise.
208-216
- Martin Zimmermann:
Time-Optimal Winning Strategies for Poset Games.
217-226
- Rusins Freivalds:
Amount of Nonconstructivity in Finite Automata.
227-236
Short Papers and Poster Abstracts
Copyright © Sat Nov 21 00:56:32 2009
by Michael Ley (ley@uni-trier.de)
