default search action
14. CIAA 2009: Sydney, Australia
Sebastian Maneth:
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
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 - Adam Clarridge, Kai Salomaa:
A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule. 44-53 - 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 - Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz:
Random Generation of Deterministic Tree (Walking) Automata. 115-124 - 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 - 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
Short Papers and Poster Abstracts
- Javier M. Sastre-Martínez:
Efficient Parsing Using Filtered-Popping Recursive Transition Networks. 241-244 - Loek G. Cleophas, Kees Hemerik:
Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms. 245-248
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2015-02-28 01:45 CET by the dblp team