Amazon cover image
Image from Amazon.com

Automata Implementation [electronic resource] : 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers /

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 2214Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001Edition: 1st ed. 2001Description: VII, 189 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540455264
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 005.45 23
LOC classification:
  • QA76.76.C65
Online resources:
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.
In: Springer Nature eBook
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in