Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel
Proceedings of the 16th International Conference on Implementation and Application of Automata
CIAA, 2011.

@proceedings{CIAA-2011,
	address       = "Blois, France",
	doi           = "10.1007/978-3-642-22256-6",
	editor        = "Béatrice Bouchou-Markhoff and Pascal Caron and Jean-Marc Champarnaud and Denis Maurel",
	isbn          = "978-3-642-22255-9",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 16th International Conference on Implementation and Application of Automata}",
	volume        = 6807,
	year          = 2011,
}

Contents (27 items)

12 ×#automaton
4 ×#finite
3 ×#nondeterminism
3 ×#word
2 ×#algorithm
2 ×#approach
2 ×#complexity
2 ×#on the
2 ×#problem
2 ×#random

CIAA-2011-Yu

Derick Wood: Always in Our Hearts (SY), pp. 1–2.

CIAA-2011-GauwinN #xpath

Streamable Fragments of Forward XPath (OG, JN), pp. 3–15.

CIAA-2011-HolzerK #automaton #finite

Gaining Power by Input Operations: Finite Automata and Beyond (MH, MK), pp. 16–29.

CIAA-2011-AmaviCAR #xml

Weak Inclusion for XML Types (JA, JC, MHFA, PR), pp. 30–41.

CIAA-2011-BechetDF #strict

Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages (DB, AJD, AF), pp. 42–52.

CIAA-2011-Buchnik #algorithm #multi #named #string

Bouma2 — A High-Performance Input-Aware Multiple String-Match Algorithm (EB), pp. 53–64.

CIAA-2011-CarninoF #automaton #generative #markov #random #using

Random Generation of Deterministic Acyclic Automata Using Markov Chains (VC, SDF), pp. 65–75.

CIAA-2011-CastanoC #approach #satisfiability

Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability (JMC, RC), pp. 76–87.

CIAA-2011-CastiglioneRS #algorithm #automaton #nondeterminism

Nondeterministic Moore Automata and Brzozowski’s Algorithm (GC, AR, MS), pp. 88–99.

CIAA-2011-ChairungseeC #word

Building Phylogeny with Minimal Absent Words (SC, MC), pp. 100–109.

CIAA-2011-ChengJBK #on the #synthesis

On the Hardness of Priority Synthesis (CHC, BJ, CB, AK), pp. 110–117.

CIAA-2011-DaciukW #automaton #finite #representation

Smaller Representation of Finite State Automata (JD, DW), pp. 118–129.

CIAA-2011-FelscherT #composition #detection

Compositional Failure Detection in Structured Transition Systems (IF, WT), pp. 130–141.

CIAA-2011-Gawrychowski #normalisation

Chrobak Normal Form Revisited, with Applications (PG), pp. 142–153.

CIAA-2011-HanK #automaton

A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule (YSH, SKK), pp. 154–165.

CIAA-2011-HeamHK #automaton

Loops and Overloops for Tree Walking Automata (PCH, VH, OK), pp. 166–177.

CIAA-2011-HolzerKM #complexity #nondeterminism

Nondeterministic State Complexity of Star-Free Languages (MH, MK, KM), pp. 178–189.

CIAA-2011-Ibarra #equivalence #linear #on the #problem #transducer

On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (OHI), pp. 190–202.

CIAA-2011-JezM #automaton #performance

Computing All ℓ-Cover Automata Fast (AJ, AM), pp. 203–214.

CIAA-2011-KushikEY #adaptation #finite #nondeterminism #state machine

Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines (NK, KEF, NY), pp. 215–224.

CIAA-2011-LonatiP #2d #automaton #towards

Towards More Expressive 2D Deterministic Automata (VL, MP), pp. 225–237.

CIAA-2011-Martyugin #automaton #complexity #problem #word

Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (PM), pp. 238–249.

CIAA-2011-OrtizLS #automaton #distributed

Distributed Event Clock Automata — Extended Abstract (JJO, AL, PYS), pp. 250–263.

CIAA-2011-CourcelleD

Fly-Automata, Their Properties and Applications (BC, ID), pp. 264–272.

CIAA-2011-FlouriJMIP #automaton #order

Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (TF, JJ, BM, CSI, SPP), pp. 273–281.

CIAA-2011-PajicPP #approach #finite #information management #transducer

Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach (VP, GPL, MP), pp. 282–289.

CIAA-2011-SkvortsovT #automaton #case study #random #word

Experimental Study of the Shortest Reset Word of Random Automata (ES, ET), pp. 290–298.