Automata Implementation 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers
Other Authors: | , |
---|---|
Format: | eBook |
Language: | English |
Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2001, 2001
|
Edition: | 1st ed. 2001 |
Series: | Lecture Notes in Computer Science
|
Subjects: | |
Online Access: | |
Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
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