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.
Author(s): Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem (auth.), Oliver Boldt, Helmut Jürgensen (eds.)
Series: Lecture Notes in Computer Science 2214
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001
Language: English
Pages: 189
Tags: Computation by Abstract Devices; Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics); Pattern Recognition; Logic Design
FA Minimisation Heuristics for a Class of Finite Languages....Pages 1-12
SEA: A Symbolic Environment for Automata Theory....Pages 13-26
Analysis of Reactive Systems with n Timers....Pages 27-38
Animation of the Generation and Computation of Finite Automata for Learning Software....Pages 39-47
Metric Lexical Analysis....Pages 48-59
State Complexity of Basic Operations on Finite Languages....Pages 60-70
Treatment of Unknown Words....Pages 71-80
Computing Entropy Maps of Finite-Automaton-Encoded Binary Images....Pages 81-90
Thompson Digraphs: A Characterization....Pages 91-100
Finite Automata Encoding Geometric Figures....Pages 101-108
Compressed Storage of Sparse Finite-State Transducers....Pages 109-121
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing....Pages 122-139
Multiset Processing by Means of Systems of Finite State Transducers....Pages 140-157
A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits....Pages 158-163
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata....Pages 164-173
A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata....Pages 174-182
