Automata Implementation
Editat de Darrell Raymond, Derick Wood, Sheng Yuen Limba Engleză Paperback – 18 iun 1997
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.
Preț: 316.28 lei
Preț vechi: 395.35 lei
-20% Nou
Puncte Express: 474
Preț estimativ în valută:
55.97€ • 65.27$ • 49.14£
55.97€ • 65.27$ • 49.14£
Carte tipărită la comandă
Livrare economică 15-29 ianuarie 26
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 12 mm
Greutate: 0.32 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540631747
Pagini: 204
Ilustrații: VIII, 192 p.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.32 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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++.