Automata Implementation: 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revi by Oliver BoldtAutomata Implementation: 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revi by Oliver Boldt

Automata Implementation: 4th International Workshop on Implementing Automata, WIA'99 Potsdam…

byOliver BoldtEditorHelmut Jürgensen

Paperback | October 24, 2001

Pricing and Purchase Info

$114.32 online 
$136.95 list price save 16%
Earn 572 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Implementing Automata, WIA'99, held in Potsdam, Germany, in July 1999.The 16 revised full papers presented were carefully selected and improved during two rounds of reviewing and revision. The papers are devoted to issues of implementing automata of various types important for areas such as parsing, finite languages, computational linguistics, speech recognition, image and signal processing, and systems analysis.
Title:Automata Implementation: 4th International Workshop on Implementing Automata, WIA'99 Potsdam…Format:PaperbackDimensions:189 pagesPublished:October 24, 2001Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540428127

ISBN - 13:9783540428121

Reviews

Table of Contents

FA Minimisation Heuristics for a Class of Finite Languages.- SEA: A Symbolic Environment for Automata Theory.- Analysis of Reactive Systems with n Timers.- Animation of the Generation and Computation of Finite Automata for Learning Software.- Metric Lexical Analysis.- State Complexity of Basic Operations on Finite Languages.- Treatment of Unknown Words.- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images.- Thompson Digraphs: A Characterization.- Finite Automata Encoding Geometric Figures.- Compressed Storage of Sparse Finite-State Transducers.- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing.- Multiset Processing by Means of Systems of Finite State Transducers.- A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits.- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata.- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata.