Jean-Marc Champarnaud, Denis Maurel
Revised Papers of the Seventh International Conference on Implementation and Application of Automata
CIAA, 2002.

@proceedings{CIAA-2002,
	address       = "Tours, France",
	editor        = "Jean-Marc Champarnaud and Denis Maurel",
	isbn          = "3-540-40391-4",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Papers of the Seventh International Conference on Implementation and Application of Automata}",
	volume        = 2608,
	year          = 2002,
}

Contents (33 items)

13 ×#automaton
7 ×#finite
3 ×#on the
3 ×#parsing
2 ×#algebra
2 ×#algorithm
2 ×#constraints
2 ×#implementation
2 ×#nondeterminism
2 ×#simulation

CIAA-2002-Mohri #automaton

Edit-Distance of Weighted Automata (MM), pp. 1–23.

CIAA-2002-AllauzenM #transducer

p-Subsequentiable Transducers (CA, MM), pp. 24–34.

CIAA-2002-AlonsoDF #automaton #bidirectional

Tabulation of Bidirectional Push Down Automata (MAA, VJD, MVF), pp. 35–46.

CIAA-2002-AnselmoGV #automaton #finite #self

Finite Automata and Non-self-Embedding Grammars (MA, DG, SV), pp. 47–56.

CIAA-2002-BrzozowskiG #algebra #simulation

Simulation of Gate Circuits in the Algebra of Transients (JAB, MG), pp. 57–66.

CIAA-2002-CampeanuP #automaton #finite #similarity

The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata (CC, AP), pp. 67–76.

CIAA-2002-CampeanuSY #regular expression

Regex and Extended Regex (CC, KS, SY), pp. 77–84.

CIAA-2002-CzyzowiczFPR

Prime Decompositions of Regular Prefix Codes (JC, WF, AP, WR), pp. 85–94.

CIAA-2002-Fatholahzadeh #automaton #implementation

Implementation of Dictionaries via Automata and Decision Trees (AF), pp. 95–105.

CIAA-2002-GheorghiuB #algebra

Feedback-Free Circuits in the Algebra of Transients (MG, JAB), pp. 106–116.

CIAA-2002-Korner #automaton #finite #on the

On Minimizing Cover Automata for Finite Languages in O(n log n) Time (HK), pp. 117–127.

CIAA-2002-GranaAV #compilation #constraints #finite #transducer

Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers (JG, GA, JV), pp. 128–137.

CIAA-2002-GuingneN #finite #lazy evaluation

Finite State Lazy Operations in NLP (FG, FN), pp. 138–147.

CIAA-2002-HolzerK #automaton #complexity #finite #nondeterminism

State Complexity of Basic Operations on Nondeterministic Finite Automata (MH, MK), pp. 148–157.

CIAA-2002-NetoB #adaptation #automaton

Adaptive Automata — A Revisited Proposal (JJN, CB), pp. 158–168.

CIAA-2002-Okhotin #linear #performance #recognition

Efficient Automaton-Based Recognition for Linear Conjunctive Languages (AO), pp. 169–181.

CIAA-2002-Polak #equation

Syntactic Semiring and Language Equations (LP), pp. 182–193.

CIAA-2002-Sutner #automaton

Reduced Power Automata (KS), pp. 194–202.

CIAA-2002-Trahtman #algorithm #polynomial #testing

A Polynomial Time Algorithm for Left [Right] Local Testability (ANT), pp. 203–212.

CIAA-2002-Okhotin02a #boolean grammar #generative #parsing

Whale Calf, a Parser Generator for Conjunctive Grammars (AO), pp. 213–220.

CIAA-2002-Sutner02a #automaton #hybrid

automata, a Hybrid System for Computational Automata Theory (KS), pp. 221–227.

CIAA-2002-Trahtman02a #testing

A Package TESTAS for Checking Some Kinds of Testability (ANT), pp. 228–232.

CIAA-2002-Balik #array

DAWG versus Suffix Array (MB), pp. 233–238.

CIAA-2002-Bruggemann-KleinW #context-free grammar #on the #parsing #predict

On Predictive Parsing and Extended Context-Free Grammars (ABK, DW), pp. 239–247.

CIAA-2002-CaronF #normalisation

Star Normal Form, Rational Expressions, and Glushkov WFAs Properties (PC, MF), pp. 248–254.

CIAA-2002-Daciuk #algorithm #automaton #comparison #finite #set #string

Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.

CIAA-2002-LargeteauG #distributed #realtime #validation

Term Validation of Distributed Hard Real-Time Applications (GL, DG), pp. 262–269.

CIAA-2002-Tronicek #automaton #sequence

Common Subsequence Automaton (ZT), pp. 270–275.

CIAA-2002-FerroDA #fault

Searching for Asymptotic Error Repair (MVF, VMD, MAA), pp. 276–281.

CIAA-2002-BartzisB #automation #constraints #verification

Automata-Based Representations for Arithmetic Constraints in Automated Verification (CB, TB), pp. 282–288.

CIAA-2002-HolubC #implementation #on the

On the Implementation of Compact DAWG’s (JH, MC), pp. 289–294.

CIAA-2002-Holub #automaton #nondeterminism #programming #simulation

Dynamic Programming — NFA Simulation (JH), pp. 295–300.

CIAA-2002-Melichar #parsing #string

Deterministic Parsing of Cyclic Strings (BM), pp. 301–306.