Bruce W. Watson, Derick Wood
Revised Papers of the Sixth International Conference on Implementation and Application of Automata
CIAA, 2001.

@proceedings{CIAA-2001,
	address       = "Pretoria, South Africa",
	editor        = "Bruce W. Watson and Derick Wood",
	isbn          = "3-540-00400-9",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Papers of the Sixth International Conference on Implementation and Application of Automata}",
	volume        = 2494,
	year          = 2001,
}

Contents (24 items)

11 ×#automaton
11 ×#finite
3 ×#transducer
3 ×#using
2 ×#adaptation
2 ×#generative
2 ×#image
2 ×#modelling
2 ×#on the

CIAA-2001-AlegriaAEEU #finite #natural language #using

Using Finite State Technology in Natural Language Processing of Basque (IA, MJA, NE, AE, RU), pp. 1–12.

CIAA-2001-BergeronH #algorithm

Cascade Decompositions are Bit-Vector Algorithms (AB, SH), pp. 13–26.

CIAA-2001-Bochmann

Submodule Construction and Supervisory Control: A Generalization (GvB), pp. 27–39.

CIAA-2001-BoigelotL #equation

Counting the Solutions of Presburger Equations without Enumerating Them (BB, LL), pp. 40–51.

CIAA-2001-ChamparnaudD #multi

Brzozowski’s Derivatives Extended to Multiplicities (JMC, GD), pp. 52–64.

CIAA-2001-DaciukN #automaton #finite #modelling #representation

Finite Automata for Compact Representation of Language Models in NLP (JD, GvN), pp. 65–73.

CIAA-2001-DangBIK #automaton

Past Pushdown Timed Automata (ZD, TB, OHI, RAK), pp. 74–86.

CIAA-2001-DubernardG #automaton #finite #generative #scheduling

Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions (JPD, DG), pp. 87–100.

CIAA-2001-FarreG #bound #parsing

Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers (JF, JFG), pp. 101–114.

CIAA-2001-FriburgerM #finite #transducer

Finite-State Transducer Cascade to Extract Proper Names in Texts (NF, DM), pp. 115–124.

CIAA-2001-Gaal #finite #question #transducer

Is this Finite-State Transducer Sequentiable? (TG), pp. 125–134.

CIAA-2001-GranaBA #automaton #compilation #finite #scalability

Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries (JG, FMB, MAA), pp. 135–148.

CIAA-2001-Holub #automaton #nondeterminism #parallel #simulation

Bit Parallelism — NFA Simulation (JH), pp. 149–160.

CIAA-2001-HolzerK #encoding #image #order #using

Improving Raster Image Run-Length Encoding Using Data Order (MH, MK), pp. 161–176.

CIAA-2001-KatritzkeMT #automaton #clustering #finite #image #using

Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata (FK, WM, MT), pp. 177–189.

CIAA-2001-Kempe #finite #transducer

Extraction of epsilon-Cyclesfrom Finite-State Transducers (AK), pp. 190–201.

CIAA-2001-MelicharS #automaton #finite #on the

On the Size of Deterministic Finite Automata (BM, JS), pp. 202–213.

CIAA-2001-MoreySMW #automaton

Crystal Lattice Automata (JM, KS, REM, MWW), pp. 214–220.

CIAA-2001-NedjahM #adaptation #automaton #pattern matching #performance #term rewriting

Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting (NN, LdMM), pp. 221–233.

CIAA-2001-Neto #adaptation #case study

Adaptive Rule-Driven Devices — General Formulation and Case Study (JJN), pp. 234–250.

CIAA-2001-Savary #finite #nearest neighbour

Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction (AS), pp. 251–260.

CIAA-2001-Velinov #automaton #design #modelling #on the

On the Software Design of Cellular Automata Simulators for Ecological Modeling (YV), pp. 261–262.

CIAA-2001-Zijl #generative #random

Random Number Generation with +-NFAs (LvZ), pp. 263–273.

CIAA-2001-Zijl01a #automaton #finite

Supernondeterministic Finite Automata (LvZ), pp. 274–288.