↓ 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 WIA and the practice of theory in computer science
  3. Altmetric Badge
    Chapter 2 Algorithms for guided tree automata
  4. Altmetric Badge
    Chapter 3 Time series forecasting by finite-state automata
  5. Altmetric Badge
    Chapter 4 Dynamical implementation of nondeterministic automata and concurrent systems
  6. Altmetric Badge
    Chapter 5 Implementing WS1S via finite automata
  7. Altmetric Badge
    Chapter 6 Instruction computation in subset construction
  8. Altmetric Badge
    Chapter 7 Building automaton on schemata and acceptability tables
  9. Altmetric Badge
    Chapter 8 FSA utilities: A toolbox to manipulate finite-state automata
  10. Altmetric Badge
    Chapter 9 A new quadratic algorithm to convert a regular expression into an automaton
  11. Altmetric Badge
    Chapter 10 Implementing sequential and parallel programs for the homing sequence problem
  12. Altmetric Badge
    Chapter 11 Integrating hands-on work into the formal languages course via tools and programming
  13. Altmetric Badge
    Chapter 12 NFA to DFA transformation for finite languages
  14. Altmetric Badge
    Chapter 13 How to use sorting procedures to minimize DFA
  15. Altmetric Badge
    Chapter 14 FIRE Lite: FAs and REs in C++
Attention for Chapter 9: A new quadratic algorithm to convert a regular expression into an automaton
Altmetric Badge

Citations

dimensions_citation
4 Dimensions
Summary Dimensions citations
So far, Dimensions has found 4 publications that cite this research output.

4

The most recent citing publications are shown below. View all 4 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.