↓ Skip to main content
What is this page? Embed badge

Automata Implementation

Overview of attention for book
Cover of 'Automata Implementation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 FA Minimisation Heuristics for a Class of Finite Languages
  3. Altmetric Badge
    Chapter 2 SEA: A Symbolic Environment for Automata Theory
  4. Altmetric Badge
    Chapter 3 Analysis of Reactive Systems with n Timers
  5. Altmetric Badge
    Chapter 4 Animation of the Generation and Computation of Finite Automata for Learning Software
  6. Altmetric Badge
    Chapter 5 Metric Lexical Analysis
  7. Altmetric Badge
    Chapter 6 State Complexity of Basic Operations on Finite Languages
  8. Altmetric Badge
    Chapter 7 Treatment of Unknown Words
  9. Altmetric Badge
    Chapter 8 Computing Entropy Maps of Finite-Automaton-Encoded Binary Images
  10. Altmetric Badge
    Chapter 9 Thompson Digraphs: A Characterization
  11. Altmetric Badge
    Chapter 10 Finite Automata Encoding Geometric Figures
  12. Altmetric Badge
    Chapter 11 Compressed Storage of Sparse Finite-State Transducers
  13. Altmetric Badge
    Chapter 12 An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
  14. Altmetric Badge
    Chapter 13 Multiset Processing by Means of Systems of Finite State Transducers
  15. Altmetric Badge
    Chapter 14 A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits
  16. Altmetric Badge
    Chapter 15 An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
  17. Altmetric Badge
    Chapter 16 A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata
Attention for Chapter 1: FA Minimisation Heuristics for a Class of Finite Languages
Altmetric Badge

Readers on

mendeley
1 Mendeley
Summary
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
FA Minimisation Heuristics for a Class of Finite Languages
Chapter number 1
Book title
Automata Implementation
Published by
Springer, Berlin, Heidelberg, July 1999
DOI 10.1007/3-540-45526-4_1
Book ISBNs
978-3-54-042812-1, 978-3-54-045526-4
Authors

Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Canada 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Computer Science 1 100%

This page is provided by Altmetric.