This book constitutes the strictly refereed post-workshop proceedings of the First International Workshop on Implementing Automata, WIA'96, held in London, Ontario, Canada, in August 1996.
The volume presents 13 revised full papers together with an introduction and survey. The papers explore the use of software tools in formal language theory; various issues involved in the implementation of automata of all types are discussed. As the first book focusing on implementing automata, this collection of research papers defines the state of the art in the area. Generally speaking, the book advocates the practice of theory in computer science.
Author(s): Darrell Raymond (auth.), Darrell Raymond, Derick Wood, Sheng Yu (eds.)
Series: Lecture Notes in Computer Science 1260
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997
Language: English
Pages: 192
Tags: Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Computation by Abstract Devices
WIA and the practice of theory in computer science....Pages 1-5
Algorithms for guided tree automata....Pages 6-25
Time series forecasting by finite-state automata....Pages 26-34
Dynamical implementation of nondeterministic automata and concurrent systems....Pages 35-49
Implementing WS1S via finite automata....Pages 50-63
Instruction computation in subset construction....Pages 64-71
Building automaton on schemata and acceptability tables....Pages 72-86
FSA utilities: A toolbox to manipulate finite-state automata....Pages 87-108
A new quadratic algorithm to convert a regular expression into an automaton....Pages 109-119
Implementing sequential and parallel programs for the homing sequence problem....Pages 120-131
Integrating hands-on work into the formal languages course via tools and programming....Pages 132-148
NFA to DFA transformation for finite languages....Pages 149-158
How to use sorting procedures to minimize DFA....Pages 159-166
FIRE Lite: FAs and REs in C++....Pages 167-188
