Darrell R. Raymond, Derick Wood, Sheng Yu
Revised Papers of the First International Workshop on Implementing Automata
WIA, 1996.

@proceedings{WIA-1996,
	address       = "London, Ontario, Canada",
	editor        = "Darrell R. Raymond and Derick Wood and Sheng Yu",
	isbn          = "3-540-63174-7",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Papers of the First International Workshop on Implementing Automata}",
	volume        = 1260,
	year          = 1996,
}

Contents (14 items)

9 ×#automaton
4 ×#finite
3 ×#implementation
2 ×#algorithm
2 ×#nondeterminism

WIA-1996-Raymond

WIA and the Practice of Theory in Computer Science (DRR), pp. 1–5.

WIA-1996-BiehlKR #algorithm #automaton

Algorithms for Guided Tree Automata (MB, NK, TR), pp. 6–25.

WIA-1996-BoneDGM #automaton #finite

Time Series Forecasting by Finite-State Automata (RB, CD, AG, DM), pp. 26–34.

WIA-1996-GarzonE #automaton #concurrent #implementation #nondeterminism

Dynamical Implementation of Nondeterministic Automata and Concurrent Systems (MHG, EE), pp. 35–49.

WIA-1996-GlennG #automaton #finite #implementation

Implementing WS1S via Finite Automata (JG, WIG), pp. 50–63.

WIA-1996-JohnsonW #set

Instruction Computation in Subset Construction (JHJ, DW), pp. 64–71.

WIA-1996-Maurel #automaton

Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials (DM), pp. 72–86.

WIA-1996-Noord #automaton #finite

FSA Utilities: A Toolbox to Manipulate Finite-State Automata (GvN), pp. 87–108.

WIA-1996-PontyZC #algorithm #automaton #polynomial #regular expression

A New Quadratic Algorithm to Convert a Regular Expression into an Automaton (JLP, DZ, JMC), pp. 109–119.

WIA-1996-RavikumarX #implementation #parallel #problem #sequence #source code

Implementing Sequential and Parallel Programs for the Homing Sequence Problem (BR, XX), pp. 120–131.

WIA-1996-Rodger #formal method #programming #tool support

Integrating Hands-on Work into the Formal Languages Course via Tools and Programming (SHR), pp. 132–148.

WIA-1996-SalomaaY #automaton #finite #nondeterminism

NFA to DFA Transformation for Finite Languages (KS, SY), pp. 149–158.

WIA-1996-Schubert #automaton #how #sorting

How to Use Sorting Procedures to Minimize DFA (BS), pp. 159–166.

WIA-1996-Watson #c++

FIRE Lite: FAs and REs in C++ (BWW), pp. 167–188.