Raymond

Automata Implementation

First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29 - 31, 1996, Revised Papers
Mitarbeit:Raymond, Darrell; Wood, Derick; Yu Sheng

• Broschiertes Buch

Produktbeschreibung

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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 1260
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 10549844, 978-3-540-63174-3
• 1997.
• Seitenzahl: 204
• Erscheinungstermin: 18. Juni 1997
• Englisch
• Abmessung: 235mm x 155mm x 12mm
• Gewicht: 318g
• ISBN-13: 9783540631743
• ISBN-10: 3540631747
• Artikelnr.: 09244964

Inhaltsangabe

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++.