Automata Implementation (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
192
Utgivningsdatum
1997-06-01
Upplaga
1997 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Raymond, Darrell (ed.), Wood, Derick (ed.), Yu, Sheng (ed.)
Illustratör/Fotograf
Illustrations
Illustrationer
VIII, 192 p.
Dimensioner
234 x 156 x 11 mm
Vikt
291 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISSN
0302-9743
ISBN
9783540631743
Automata Implementation (häftad)

Automata Implementation

First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29 - 31, 1996, Revised Papers

Häftad Engelska, 1997-06-01
759
Skickas inom 10-15 vardagar.
Fri frakt inom Sverige för privatpersoner.
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.
Visa hela texten

Passar bra ihop

  1. Automata Implementation
  2. +
  3. Principles of Document Processing

De som köpt den här boken har ofta också köpt Principles of Document Processing av Charles Nicholas, Derick Wood (häftad).

Köp båda 2 för 1518 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Bloggat om Automata Implementation

Innehållsförteckning

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