Automata Implementation (eBook, PDF)

4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers
Redaktion: Boldt, Oliver; Jürgensen, Helmut

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 189
• Erscheinungstermin: 30. Juni 2003
• Englisch
• ISBN-13: 9783540455264
• Artikelnr.: 53145179

Autorenporträt

Oliver Boldt, Universität Potsdam / Helmut Jürgensen, Universität Potsdam

Inhaltsangabe

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.