Automata implementation : 4th International Workshop on Implementing Automata, WIA'99, Potsdam, Germany, July
User Rating: Be the first one!
Author: International Workshop on Implementing Automata (4th : 1999 : Potsdam, Germany), Boldt, Oliver, Jürgensen, Helmut
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Machine theory
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540428127
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 82.46 MB
PDF Size: 2.19 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 280
Views: 330
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 45526 4 archive t...torrent
Last Modified: 2022-03-09 08:45:31
Download
Size: 7.32 KB
Description
Automata Implementation: 4th International Workshop on Implementing Automata, WIA’99 Potsdam, Germany, July 17–19, 1999 Revised Papers
Author: Oliver Boldt, Helmut Jürgensen
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42812-1
DOI: 10.1007/3-540-45526-4
Table of Contents:
Includes bibliographical references and index
Author: Oliver Boldt, Helmut Jürgensen
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42812-1
DOI: 10.1007/3-540-45526-4
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
Includes bibliographical references and index
You May Also Like
We will be happy to hear your thoughts