Sheng Yu, Andrei Paun
Revised Papers of the Fifth International Conference on Implementation and Application of Automata
CIAA, 2000.

@proceedings{CIAA-2000,
	address       = "London, Ontario, Canada",
	editor        = "Sheng Yu and Andrei Paun",
	isbn          = "3-540-42491-1",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Papers of the Fifth International Conference on Implementation and Application of Automata}",
	volume        = 2088,
	year          = 2000,
}

Contents (35 items)

14 ×#automaton
8 ×#finite
5 ×#algorithm
5 ×#transducer
4 ×#implementation
3 ×#complexity
2 ×#nondeterminism
2 ×#specification
2 ×#web

CIAA-2000-HarelK #object-oriented #specification

Synthesizing State-Based Object Systems from LSC Specifications (DH, HK), pp. 1–33.

CIAA-2000-Karttunen #finite #natural language #transducer

Applications of Finite-State Transducers in Natural Language Processing (LK), pp. 34–46.

CIAA-2000-BergeronH #automaton #implementation #performance

Fast Implementations of Automata Computations (AB, SH), pp. 47–56.

CIAA-2000-Bruggemann-KleinW #automaton #nondeterminism

Regularly Extended Two-Way Nondeterministic Tree Automata (ABK, DW), pp. 57–66.

CIAA-2000-CaronF #multi

Glushkov Construction for Multiplicities (PC, MF), pp. 67–79.

CIAA-2000-Champarnaud #automaton #nondeterminism #regular expression

Implicit Structures to Implement NFA’s from Regular Expressions (JMC), pp. 80–93.

CIAA-2000-ChamparnaudZ #automaton #canonical #finite

New Finite Automaton Constructions Based on Canonical Derivatives (JMC, DZ), pp. 94–104.

CIAA-2000-Daciuk #automaton

Experiments with Automata Compression (JD), pp. 105–112.

CIAA-2000-DrewesEKK #grid #image

Computing Raster Images from Grid Picture Grammars (FD, SE, RKH, HJK), pp. 113–121.

CIAA-2000-FarreG #parsing

A Basis for Looping Extensions to Discriminating-Reverse Parsing (JF, JFG), pp. 122–134.

CIAA-2000-Heam #automaton

Automata for Pro-V Topologies (PCH), pp. 135–144.

CIAA-2000-Ibarra #queue #reachability #safety

Reachability and Safety in Queue Systems (OHI), pp. 145–156.

CIAA-2000-IbarraS #automaton

Generalizing the Discrete Timed Automaton (OHI, JS), pp. 157–169.

CIAA-2000-Kempe #ambiguity #finite #transducer

Factorization of Ambiguous Finite-State Transducers (AK), pp. 170–181.

CIAA-2000-KlarlundMS #implementation

MONA Implementation Secrets (NK, AM, MIS), pp. 182–194.

CIAA-2000-Maout

Cursors (VLM), pp. 195–207.

CIAA-2000-LodayaR #automaton #navigation #web

An Automaton Model of User-Controlled Navigation on the Web (KL, RR), pp. 208–216.

CIAA-2000-MihovM #transducer

Direct Construction of Minimal Acyclic Subsequential Transducers (SM, DM), pp. 217–229.

CIAA-2000-Mohri #algorithm #automaton

Generic epsilon -Removal Algorithm for Weighted Automata (MM), pp. 230–242.

CIAA-2000-PaunSY #algorithm #automaton #finite

An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages (AP, NS, SY), pp. 243–251.

CIAA-2000-Pighizzini #complexity

Unary Language Concatenation and Its State Complexity (GP), pp. 252–262.

CIAA-2000-SchmitzV #algorithm #finite #game studies #implementation

Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games (DS, JV), pp. 263–271.

CIAA-2000-Shallit #complexity

State Complexity and Jacobsthal’s Function (JS), pp. 272–278.

CIAA-2000-ShankarSAR #automaton #finite #implementation

A Package for the Implementation of Block Codes as Finite Automata (PS, KS, VA, BSR), pp. 279–292.

CIAA-2000-FerroDR #fault

Regional Least-Cost Error Repair (MVF, VMD, FJR), pp. 293–301.

CIAA-2000-Wareham #automaton #complexity #composition #finite #set

The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata (TW), pp. 302–310.

CIAA-2000-Watson #algorithm

Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski (BWW), pp. 311–317.

CIAA-2000-ZijlHO

The MERLin Environment Applied to *-NFAs (LvZ, JPH, FO), pp. 318–326.

CIAA-2000-DiehlKW #algorithm #automaton #finite #generative #visual notation #web

Visual Exploration of Generation Algorithms for Finite Automata on the Web (SD, AK, TW), pp. 327–328.

CIAA-2000-DrewesK

TREEBAG (FD, RKH), pp. 329–330.

CIAA-2000-DvorskyS #random #word

Word Random Access Compression (JD, VS), pp. 331–332.

CIAA-2000-Gaal #transducer

Extended Sequentialization of Transducers (TG), pp. 333–334.

CIAA-2000-Johnson #lessons learnt #specification

Lessons from INR in the Specification of Transductions (JHJ), pp. 335–336.

CIAA-2000-Kempe00a #transducer

Part-of-Speech Tagging with Two Sequential Transducers (AK), pp. 337–339.

CIAA-2000-Neto #adaptation #automaton #problem

Solving Complex Problems Efficiently with Adaptive Automata (JJN), pp. 340–342.