Cantitate/Preț
Produs

Automata Implementation: First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29 - 31, 1996, Revised Papers: Lecture Notes in Computer Science, cartea 1260

Editat de Darrell Raymond, Derick Wood, Sheng Yu
en Limba Engleză Paperback – 18 iun 1997
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31843 lei

Preț vechi: 39804 lei
-20% Nou

Puncte Express: 478

Preț estimativ în valută:
6095 6352$ 5074£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540631743
ISBN-10: 3540631747
Pagini: 204
Ilustrații: VIII, 192 p.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.29 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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