Automata implementation : 4th International Workshop on Implementing Automata, WIA'99, Potsdam, Germany, July 17-19, 1999 : revised papers / Oliver Boldt, Helmut Jürgensen (eds.).

By: (4th : International Workshop on Implementing Automata (4th : 1999 : Potsdam, Germany)
Contributor(s): Boldt, Oliver | Jürgensen, Helmut
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 2214.Publisher: Berlin ; New York : Springer, ©2001Description: 1 online resource (182 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540455264; 3540455264Subject(s): Machine theory -- Congresses | Machine theory | Algebra | Mathematics | Physical Sciences & MathematicsGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:International Workshop on Implementing Automata (4th : 1999 : Potsdam, Germany): Automata implementation : 4th International Workshop on Implementing Automata, WIA'99, Potsdam, Germany, July 17-19, 1999 : revised papersDDC classification: 004 LOC classification: QA267 | .I5787 1999Other classification: 54.10 | DAT 550f | SS 4800 Online resources: Click here to access online
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.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

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.

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.

English.

There are no comments for this item.

to post a comment.

Powered by Koha