Jacques Farré, Igor Litovsky, Sylvain Schmitz
Revised Selected Papers of the 10th International Conference on Implementation and Application of Automata
CIAA, 2005.

@proceedings{CIAA-2005,
	address       = "Sophia Antipolis, France",
	editor        = "Jacques Farré and Igor Litovsky and Sylvain Schmitz",
	isbn          = "3-540-31023-1",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Selected Papers of the 10th International Conference on Implementation and Application of Automata}",
	volume        = 3845,
	year          = 2005,
}

Contents (36 items)

22 ×#automaton
7 ×#finite
4 ×#on the
3 ×#equivalence
2 ×#2d
2 ×#algorithm
2 ×#incremental
2 ×#learning
2 ×#linear
2 ×#recognition

CIAA-2005-Freivalds #automaton #finite #quantum

Languages Recognizable by Quantum Finite Automata (RF), pp. 1–14.

CIAA-2005-Sakarovitch #automaton

The Language, the Expression, and the (Small) Automaton (JS), pp. 15–30.

CIAA-2005-AbdullaDKN #automaton #nondeterminism #scalability

Minimization of Non-deterministic Automata with Large Alphabets (PAA, JD, LK, MN), pp. 31–42.

CIAA-2005-AnselmoM #2d #automaton #queue #simulation

Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata (MA, MM), pp. 43–53.

CIAA-2005-BaillyCS #behaviour #communication #component #composition #contract

Component Composition Preserving Behavioural Contracts Based on Communication Traces (AB, MC, ISR), pp. 54–65.

CIAA-2005-Bartha #equivalence

Strong Retiming Equivalence of Synchronous Schemes (MB), pp. 66–77.

CIAA-2005-BastienCFR #equivalence #normalisation

Prime Normal Form and Equivalence of Simple Grammars (CB, JC, WF, WR), pp. 78–89.

CIAA-2005-CampeanuPS #algorithm #automaton #finite #incremental

An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata (CC, AP, JRS), pp. 90–103.

CIAA-2005-CanoG #automaton #bound #constant #finite

Finite Automata and Unions of Regular Patterns with Bounded Constant Segments (AC, PG), pp. 104–115.

CIAA-2005-ClaveiroleLOPS

Inside Vaucanson (TC, SL, SO, LNP, JS), pp. 116–128.

CIAA-2005-FujiyoshiK #automaton #linear #recognition

Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton (AF, IK), pp. 129–140.

CIAA-2005-HanW #automaton #finite #regular expression

Shorter Regular Expressions from Finite-State Automata (YSH, DW), pp. 141–152.

CIAA-2005-Hogberg #generative #music #transducer

Wind in the Willows — Generating Music by Means of Tree Transducers (JH), pp. 153–162.

CIAA-2005-IbarraY #on the

On Deterministic Catalytic Systems (OHI, HCY), pp. 163–175.

CIAA-2005-JurdzinskiO #automaton #strict #using

Restricting the Use of Auxiliary Symbols for Restarting Automata (TJ, FO), pp. 176–187.

CIAA-2005-KempeCEGN

A Class of Rational n-WFSM Auto-intersections (AK, JMC, JE, FG, FN), pp. 188–198.

CIAA-2005-KleinB #automaton #linear #logic

Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic (JK, CB), pp. 199–212.

CIAA-2005-Latour #diagrams #set

Computing Affine Hulls over Q and Z from Sets Represented by Number Decision Diagrams (LL), pp. 213–224.

CIAA-2005-LohreyM #automaton #xpath

Tree Automata and XPath on Compressed Trees (ML, SM), pp. 225–237.

CIAA-2005-PelanekS #automaton #ltl

Deeper Connections Between LTL and Alternating Automata (RP, JS), pp. 238–249.

CIAA-2005-Rytter #fibonacci #graph #word

The Structure of Subword Graphs and Suffix Trees of Fibonacci Words (WR), pp. 250–261.

CIAA-2005-AlthoffTW #automaton

Observations on Determinization of Büchi Automata (CSA, WT, NW), pp. 262–272.

CIAA-2005-Shcherbak #automaton #rank

The Interval Rank of Monotonic Automata (TS), pp. 273–281.

CIAA-2005-SubramanianS #automaton #documentation #finite #recursion #using #xml

Compressing XML Documents Using Recursive Finite State Automata (HS, PS), pp. 282–293.

CIAA-2005-SudaH #algorithm #automaton #backtracking #top-down

Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment (TS, HH), pp. 294–306.

CIAA-2005-TammNU #automaton #multi #reduction

Size Reduction of Multitape Automata (HT, MN, EU), pp. 307–318.

CIAA-2005-FerroPF #robust

Robust Spelling Correction (MVF, JOP, JVF), pp. 319–328.

CIAA-2005-ZdarekM #2d #automaton #finite #on the #pattern matching

On Two-Dimensional Pattern Matching by Finite Automata (JZ, BM), pp. 329–340.

CIAA-2005-DaciukMS #automaton #incremental #pseudo

Incremental and Semi-incremental Construction of Pseudo-Minimal Automata (JD, DM, AS), pp. 341–342.

CIAA-2005-GarciaRCA #learning #question

Is Learning RFSAs Better Than Learning DFAs? (PG, JR, AC, GIA), pp. 343–344.

CIAA-2005-HigueraPT #automaton #finite #learning #probability #recognition

Learning Stochastic Finite Automata for Musical Style Recognition (CdlH, FP, FT), pp. 345–346.

CIAA-2005-Kresz #simulation

Simulation of Soliton Circuits (MK), pp. 347–348.

CIAA-2005-MoraisMR #automaton #regular expression

Acyclic Automata with Easy-to-Find Short Regular Expressions (JJM, NM, RR), pp. 349–350.

CIAA-2005-PodlovchenkoRZ #equivalence #on the #problem #source code

On the Equivalence Problem for Programs with Mode Switching (RIP, DMR, VAZ), pp. 351–352.

CIAA-2005-Tellier #automaton

Automata and AB-Categorial Grammars (IT), pp. 353–355.

CIAA-2005-VielhaberC #infinity #on the #set #transducer

On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set (MV, MdPCC), pp. 356–357.