Michael Domaratzki, Kai Salomaa
Revised Selected Papers of the 15th International Conference on Implementation and Application of Automata
CIAA, 2010.

@proceedings{CIAA-2010,
	address       = "Winnipeg, Manitoba, Canada",
	doi           = "10.1007/978-3-642-18098-9",
	editor        = "Michael Domaratzki and Kai Salomaa",
	isbn          = "978-3-642-18097-2",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Selected Papers of the 15th International Conference on Implementation and Application of Automata}",
	volume        = 6482,
	year          = 2010,
}

Contents (34 items)

16 ×#automaton
7 ×#regular expression
3 ×#finite
3 ×#using
2 ×#complexity
2 ×#composition
2 ×#graph
2 ×#on the
2 ×#performance
2 ×#scalability

CIAA-2010-Jonoska #automaton #self #using

Using Automata to Describe Self-Assembled Nanostructures (NJ), pp. 1–3.

CIAA-2010-Rudie #problem #summary

A Summary of Some Discrete-Event System Control Problems (KR), pp. 4–16.

CIAA-2010-AllauzenCM #automaton #kernel #scalability

Large-Scale Training of SVMs with Automata Kernels (CA, CC, MM), pp. 17–27.

CIAA-2010-AllauzenRS #composition #finite #performance #transducer

Filters for Efficient Composition of Weighted Finite-State Transducers (CA, MR, JS), pp. 28–38.

CIAA-2010-AlmeidaMR #automaton #incremental

Incremental DFA Minimisation (MA, NM, RR), pp. 39–48.

CIAA-2010-AntosM #approach #automaton #finite #pattern matching

Finite Automata for Generalized Approach to Backward Pattern Matching (JA, BM), pp. 49–58.

CIAA-2010-AlmeidaMPS #automaton #coq

Partial Derivative Automata Formalized in Coq (JBA, NM, DP, SMdS), pp. 59–68.

CIAA-2010-ChamparnaudDJ #geometry

Regular Geometrical Languages and Tiling the Plane (JMC, JPD, HJ), pp. 69–78.

CIAA-2010-ChmielR #named

COMPAS — A Computing Package for Synchronization (KC, AR), pp. 79–86.

CIAA-2010-CimattiMRT #automaton #nondeterminism #regular expression

From Sequential Extended Regular Expressions to NFA with Symbolic Labels (AC, SM, MR, ST), pp. 87–94.

CIAA-2010-CuiGKY #complexity

State Complexity of Catenation Combined with Union and Intersection (BC, YG, LK, SY), pp. 95–104.

CIAA-2010-DiekertK #complexity #regular expression

Complexity Results and the Growths of Hairpin Completions of Regular Languages (VD, SK), pp. 105–114.

CIAA-2010-Egri-NagyN #finite #on the #word

On Straight Words and Minimal Permutators in Finite Transformation Semigroups (AEN, CLN), pp. 115–124.

CIAA-2010-EpifanioFGMS #graph #lazy evaluation #on the

On Lazy Representations and Sturmian Graphs (CE, CF, AG, FM, JS), pp. 125–134.

CIAA-2010-ForysOB #automaton #infinity

Symbolic Dynamics, Flower Automata and Infinite Traces (WF, PO, SB), pp. 135–142.

CIAA-2010-Grosu #commutative #theorem

The Cayley-Hamilton Theorem for Noncommutative Semirings (RG), pp. 143–153.

CIAA-2010-GerbushH #approximate #sequence

Approximating Minimum Reset Sequences (MG, BH), pp. 154–162.

CIAA-2010-HundeshagenOV #automaton

Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata (NH, FO, MV), pp. 163–172.

CIAA-2010-Johnson #natural language #using

Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization (JHJ), pp. 173–180.

CIAA-2010-KufleitnerL #automaton #order

Partially Ordered Two-Way Büchi Automata (MK, AL), pp. 181–190.

CIAA-2010-KutribM

Two-Party Watson-Crick Computations (MK, AM), pp. 191–200.

CIAA-2010-Maletti #fault #performance

Better Hyper-minimization — Not as Fast, But Fewer Errors (AM), pp. 201–210.

CIAA-2010-DrosteM #regular expression

Regular Expressions on Average and in the Long Run (MD, IM), pp. 211–221.

CIAA-2010-Neider #automation #game studies #graph #reachability

Reachability Games on Automatic Graphs (DN), pp. 222–230.

CIAA-2010-OkuiS #ambiguity #automaton #regular expression

Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions (SO, TS), pp. 231–240.

CIAA-2010-ReidenbachS #polynomial #regular expression #scalability

A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (DR, MLS), pp. 241–250.

CIAA-2010-CastiglioneNS #algorithm #automaton #product line

A Challenging Family of Automata for Classical Minimization Algorithms (GC, CN, MS), pp. 251–260.

CIAA-2010-TsaiFVT #automaton

State of Büchi Complementation (MHT, SF, MYV, YKT), pp. 261–271.

CIAA-2010-TirnaucaT #automaton #identification #query

Types of Trusted Information That Make DFA Identification with Correction Queries Feasible (CT, CIT), pp. 272–281.

CIAA-2010-LiuGLT #automaton #composition #matrix #regular expression

Compressing Regular Expressions’ DFA Table by Matrix Decomposition (YL, LG, PL, JT), pp. 282–289.

CIAA-2010-YuBI #automaton #multi #relational #string #using #verification

Relational String Verification Using Multi-track Automata (FY, TB, OHI), pp. 290–299.

CIAA-2010-ZdarekM #2d

A Note on a Tree-Based 2D Indexing (JZ, BM), pp. 300–309.

CIAA-2010-Maout #design #regular expression

Regular Expressions at Their Best: A Case for Rational Design (VLM), pp. 310–320.

CIAA-2010-EsikM #automaton #simulation

Simulations of Weighted Tree Automata (ZÉ, AM), pp. 321–330.