Automata Implementation

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Extended Context-Free Grammars and Normal Form Algorithms
3. Altmetric Badge
   Chapter 2 On Parsing LL -Languages
4. Altmetric Badge
   Chapter 3 On Parsing and Condensing Substrings of LR Languages in Linear Time
5. Altmetric Badge
   Chapter 4 Minimal Cover-Automata for Finite Languages
6. Altmetric Badge
   Chapter 5 Determinization of Glushkov Automata
7. Altmetric Badge
   Chapter 6 Implementing Reversed Alternating Finite Automaton (r-AFA) Operations
8. Altmetric Badge
   Chapter 7 Operations on DASG
9. Altmetric Badge
   Chapter 8 Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching
10. Altmetric Badge
    Chapter 9 The Syntactic Prediction with Token Automata: Application to HandiAS System
11. Altmetric Badge
    Chapter 10 Bi-directional Automata to Extract Complex Phrases from Texts
12. Altmetric Badge
    Chapter 11 A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs
13. Altmetric Badge
    Chapter 12 Using Acceptors as Transducers
14. Altmetric Badge
    Chapter 13 Proving Sequential Function Chart Programs Using Automata
15. Altmetric Badge
    Chapter 14 Automata and Computational Probabilities
16. Altmetric Badge
    Chapter 15 Automata and Binary Decision Diagrams
17. Altmetric Badge
    Chapter 16 Operations over Automata with Multiplicities
18. Altmetric Badge
    Chapter 17 Paging Automata
19. Altmetric Badge
    Chapter 18 On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment
20. Altmetric Badge
    Chapter 19 The Finite State Automata’s Design Patterns
21. Altmetric Badge
    Chapter 20 Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set
22. Altmetric Badge
    Chapter 21 Autographe: A Graphical Version of Automate
23. Altmetric Badge
    Chapter 22 INTEX 4.1 for Windows: A Walkthrough