Oliver Boldt, Helmut Jürgensen
Revised Papers of the Fourth International Workshop on Implementing Automata
WIA, 1999.

@proceedings{WIA-1999,
	address       = "Potsdam, Germany",
	editor        = "Oliver Boldt and Helmut Jürgensen",
	isbn          = "3-540-42812-7",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Papers of the Fourth International Workshop on Implementing Automata}",
	volume        = 2214,
	year          = 1999,
}

Contents (16 items)

9 ×#finite
6 ×#automaton
2 ×#algorithm
2 ×#analysis
2 ×#transducer

WIA-1999-AmilhastreJV #finite #heuristic

FA Minimisation Heuristics for a Class of Finite Languages (JA, PJ, MCV), pp. 1–12.

WIA-1999-AndaryCCDFL #automaton #named

SEA: A Symbolic Environment for Automata Theory (PA, PC, JMC, GD, MF, ÉL), pp. 13–26.

WIA-1999-BergeronC #analysis

Analysis of Reactive Systems with n Timers (AB, RC), pp. 27–38.

WIA-1999-BrauneDKW #animation #automaton #finite #generative #learning

Animation of the Generation and Computation of Finite Automata for Learning Software (BB, SD, AK, RW), pp. 39–47.

WIA-1999-CaludeSY #analysis #metric

Metric Lexical Analysis (CC, KS, SY), pp. 48–59.

WIA-1999-CampeanuCSY #complexity #finite

State Complexity of Basic Operations on Finite Languages (CC, KCI, KS, SY), pp. 60–70.

WIA-1999-Daciuk #word

Treatment of Unknown Words (JD), pp. 71–80.

WIA-1999-Eramian #image

Computing Entropy Maps of Finite-Automaton-Encoded Binary Images (MGE), pp. 81–90.

WIA-1999-GiammarresiPW #graph

Thompson Digraphs: A Characterization (DG, JLP, DW), pp. 91–100.

WIA-1999-JurgensenS #automaton #encoding #finite #geometry

Finite Automata Encoding Geometric Figures (HJ, LS), pp. 101–108.

WIA-1999-Kiraz #finite #transducer

Compressed Storage of Sparse Finite-State Transducers (GAK), pp. 109–121.

WIA-1999-NoordG #compilation #finite #natural language #regular expression

An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing (GvN, DG), pp. 122–139.

WIA-1999-PaunT #finite #multi #transducer

Multiset Processing by Means of Systems of Finite State Transducers (GP, GT), pp. 140–157.

WIA-1999-SeuringG #automaton

A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits (MS, MG), pp. 158–163.

WIA-1999-Trahtman #algorithm #automaton #finite #testing #verification

An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata (ANT), pp. 164–173.

WIA-1999-Watson #algorithm #automaton #finite #taxonomy

A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata (BWW), pp. 174–182.