FEEDBACK Smiley face
Normal view MARC view ISBD view

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

Contributor(s): Boldt, Oliver [editor.] | Jürgensen, Helmut [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 2214Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2001.Description: VII, 189 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540455264.Subject(s): Computer science | Programming languages (Electronic computers) | Computers | Mathematical logic | Artificial intelligence | Pattern recognition | Computer Science | Programming Languages, Compilers, Interpreters | Mathematical Logic and Foundations | Artificial Intelligence (incl. Robotics) | Computation by Abstract Devices | Mathematical Logic and Formal Languages | Pattern RecognitionOnline 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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    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 for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in