CIAA C

33 papers

YearTitle / Authors
2009A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule.
Adam Clarridge, Kai Salomaa
2009A Table Compression Method for Extended Aho-Corasick Automaton.
Yanbing Liu, Yifu Yang, Ping Liu, Jianlong Tan
2009A Testing Framework for Finite-State Morphology.
François Barthélemy
2009Amount of Nonconstructivity in Finite Automata.
Rusins Freivalds
2009An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.
Markus Holzer, Andreas Maletti
2009Applications of Automata in XML Processing.
Christoph Koch
2009Are Statecharts Finite Automata?
Hanlin Lu, Sheng Yu
2009Automata-Based Termination Proofs.
Radu Iosif, Adam Rogalewicz
2009Cellular Automata with Sparse Communication.
Martin Kutrib, Andreas Malcher
2009Compact Normal Form for Regular Languages as Xor Automata.
Jean Vuillemin, Nicolas Gama
2009Compact Representation for Answer Sets of n-ary Regular Queries.
Kazuhiro Inaba, Haruo Hosoya
2009Compiler Generator Based on Restarting Automata.
Jan Procházka
2009Efficient Parsing Using Filtered-Popping Recursive Transition Networks.
Javier Miguel Sastre-Martínez
2009FAdo and GUItar.
André Almeida, Marco Almeida, José Alves, Nelma Moreira, Rogério Reis
2009Fixpoint Guided Abstraction Refinement for Alternating Automata.
Pierre Ganty, Nicolas Maquet, Jean-François Raskin
2009Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms.
Loek G. Cleophas, Kees Hemerik
2009Formally Synthesising a Protocol Converter: A Case Study.
Jing Cao, Albert Nymeyer
2009Hedge Pattern Partial Derivative.
Taro Suzuki, Satoshi Okui
2009Implementation and Application of Automata in String Processing.
Gonzalo Navarro
2009Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings
Sebastian Maneth
2009Implementation of State Elimination Using Heuristics.
Jae-Hee Ahn, Yo-Sub Han
2009Multiflex: A Multilingual Finite-State Tool for Multi-Word Units.
Agata Savary
2009On Extremal Cases of Hopcroft's Algorithm.
Giusi Castiglione, Antonio Restivo, Marinella Sciortino
2009On Parallel Implementations of Deterministic Finite Automata.
Jan Holub, Stanislav Stekr
2009Program Analysis through Finite Tree Automata.
Helmut Seidl
2009Quantum Queries on Permutations with a Promise.
Rusins Freivalds, Kazuo Iwama
2009Random Generation of Deterministic Tree (Walking) Automata.
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
2009Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata.
Akio Fujiyoshi
2009Short Regular Expressions from Finite Automata: Empirical Results.
Hermann Gruber, Markus Holzer, Michael Tautschnig
2009Small Extended Expressions for Acyclic Automata.
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
2009TAGED Approximations for Temporal Properties Model-Checking.
Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
2009Time-Optimal Winning Strategies for Poset Games.
Martin Zimmermann
2009Verifying Parallel Programs with Dynamic Communication Structures.
Mohamed Faouzi Atig, Tayssir Touili