Sebastian Maneth
Proceedings of the 14th International Conference on Implementation and Application of Automata
CIAA, 2009.

@proceedings{CIAA-2009,
	address       = "Sydney, Australia",
	doi           = "10.1007/978-3-642-02979-0",
	editor        = "Sebastian Maneth",
	isbn          = "978-3-642-02978-3",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 14th International Conference on Implementation and Application of Automata}",
	volume        = 5642,
	year          = 2009,
}

Contents (32 items)

18 ×#automaton
7 ×#finite
3 ×#algorithm
3 ×#implementation
2 ×#communication
2 ×#generative
2 ×#on the
2 ×#parallel
2 ×#query
2 ×#regular expression

CIAA-2009-Navarro #automaton #implementation #string

Implementation and Application of Automata in String Processing (GN), p. 1.

CIAA-2009-Koch #automaton #xml

Applications of Automata in XML Processing (CK), p. 2.

CIAA-2009-Seidl #automaton #finite #program analysis

Program Analysis through Finite Tree Automata (HS), p. 3.

CIAA-2009-HolzerM #algorithm #automaton

An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (MH, AM), pp. 4–13.

CIAA-2009-CastiglioneRS #algorithm #on the

On Extremal Cases of Hopcroft’s Algorithm (GC, AR, MS), pp. 14–23.

CIAA-2009-VuilleminG #automaton #normalisation #regular expression

Compact Normal Form for Regular Languages as Xor Automata (JV, NG), pp. 24–33.

CIAA-2009-KutribM #automaton #communication

Cellular Automata with Sparse Communication (MK, AM), pp. 34–43.

CIAA-2009-ClarridgeS #automaton

A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule (AC, KS), pp. 44–53.

CIAA-2009-HolubS #automaton #finite #implementation #on the #parallel

On Parallel Implementations of Deterministic Finite Automata (JH, SS), pp. 54–64.

CIAA-2009-AlmeidaAAMR

FAdo and GUItar (AA, MA, JA, NM, RR), pp. 65–74.

CIAA-2009-Barthelemy #finite #framework #testing

A Testing Framework for Finite-State Morphology (FB), pp. 75–83.

CIAA-2009-LiuYLT #automaton

A Table Compression Method for Extended Aho-Corasick Automaton (YL, YY, PL, JT), pp. 84–93.

CIAA-2009-InabaH #query #representation #set

Compact Representation for Answer Sets of n-ary Regular Queries (KI, HH), pp. 94–104.

CIAA-2009-Fujiyoshi #automaton #graph #recognition

Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata (AF), pp. 105–114.

CIAA-2009-HeamNS #automaton #generative #random

Random Generation of Deterministic Tree (Walking) Automata (PCH, CN, SS), pp. 115–124.

CIAA-2009-SuzukiO

Hedge Pattern Partial Derivative (TS, SO), pp. 125–134.

CIAA-2009-CourbisHK #approximate #model checking

TAGED Approximations for Temporal Properties Model-Checking (RC, PCH, OK), pp. 135–144.

CIAA-2009-AtigT #communication #parallel #source code #verification

Verifying Parallel Programs with Dynamic Communication Structures (MFA, TT), pp. 145–154.

CIAA-2009-GantyMR #abstraction #automaton #fixpoint #refinement

Fixpoint Guided Abstraction Refinement for Alternating Automata (PG, NM, JFR), pp. 155–164.

CIAA-2009-IosifR #proving #termination

Automata-Based Termination Proofs (RI, AR), pp. 165–177.

CIAA-2009-AhnH #heuristic #implementation #using

Implementation of State Elimination Using Heuristics (JHA, YSH), pp. 178–187.

CIAA-2009-GruberHT #automaton #empirical #finite #regular expression

Short Regular Expressions from Finite Automata: Empirical Results (HG, MH, MT), pp. 188–197.

CIAA-2009-CaronCM #automaton

Small Extended Expressions for Acyclic Automata (PC, JMC, LM), pp. 198–207.

CIAA-2009-FreivaldsI #permutation #quantum #query

Quantum Queries on Permutations with a Promise (RF, KI), pp. 208–216.

CIAA-2009-Zimmermann #game studies

Time-Optimal Winning Strategies for Poset Games (MZ0), pp. 217–226.

CIAA-2009-Freivalds #automaton #finite

Amount of Nonconstructivity in Finite Automata (RF), pp. 227–236.

CIAA-2009-Savary #finite #multi #named

Multiflex: A Multilingual Finite-State Tool for Multi-Word Units (AS), pp. 237–240.

CIAA-2009-Sastre-Martinez #network #parsing #performance #recursion #using

Efficient Parsing Using Filtered-Popping Recursive Transition Networks (JMSM), pp. 241–244.

CIAA-2009-CleophasH #algorithm #automaton #tool support

Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms (LGC, KH), pp. 245–248.

CIAA-2009-CaoN #case study #protocol

Formally Synthesising a Protocol Converter: A Case Study (JC, AN), pp. 249–252.

CIAA-2009-Prochazka #automaton #compilation #generative

Compiler Generator Based on Restarting Automata (JP), pp. 253–257.

CIAA-2009-LuY #automaton #finite #question

Are Statecharts Finite Automata? (HL, SY), pp. 258–261.