Automata Implementation: 4th International Workshop on Implementing Automata, WIA’99 Potsdam, Germany, July 17–19, 1999 Revised PapersAuthor: Oliver Boldt, Helmut Jürgensen Published by Springer Berlin Heidelberg ISBN: 978-3-540-42812-1 DOI: 10.1007/3-540-45526-4Table 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, Includes bibliographical references and index