Darrell Raymond,
Derick Wood,
Sheng Yu
Springer Berlin Heidelberg
1997e druk, 1997
9783540631743
Automata Implementation
First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29 - 31, 1996, Revised Papers
Specificaties
Paperback, 192 blz.
|
Engels
Springer Berlin Heidelberg |
1997e druk, 1997
ISBN13: 9783540631743
Rubricering
Onderdeel van serie
Lecture Notes in Computer Science
Verwachte levertijd ongeveer 9 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9783540631743
Taal:Engels
Bindwijze:paperback
Aantal pagina's:192
Uitgever:Springer Berlin Heidelberg
Druk:1997
Hoofdrubriek:Programmeren, Computer en informatica
Inhoudsopgave
WIA and the practice of theory in computer science.- Algorithms for guided tree automata.- Time series forecasting by finite-state automata.- Dynamical implementation of nondeterministic automata and concurrent systems.- Implementing WS1S via finite automata.- Instruction computation in subset construction.- Building automaton on schemata and acceptability tables.- FSA utilities: A toolbox to manipulate finite-state automata.- A new quadratic algorithm to convert a regular expression into an automaton.- Implementing sequential and parallel programs for the homing sequence problem.- Integrating hands-on work into the formal languages course via tools and programming.- NFA to DFA transformation for finite languages.- How to use sorting procedures to minimize DFA.- FIRE Lite: FAs and REs in C++.