Implementation and Application of Automata

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Automata-Theoretic Techniques for Analyzing Infinite-State Systems
3. Altmetric Badge
   Chapter 2 Enumerating Regular Expressions and Their Languages
4. Altmetric Badge
   Chapter 3 A General Weighted Grammar Library
5. Altmetric Badge
   Chapter 4 On the Complexity of Hopcroft’s State Minimization Algorithm
6. Altmetric Badge
   Chapter 5 Implementation of Catalytic P Systems
7. Altmetric Badge
   Chapter 6 Code Selection by Tree Series Transducers
8. Altmetric Badge
   Chapter 7 Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages
9. Altmetric Badge
   Chapter 8 Brute Force Determinization of NFAs by Means of State Covers
10. Altmetric Badge
    Chapter 9 Computing the Follow Automaton of an Expression
11. Altmetric Badge
    Chapter 10 Viral Gene Compression: Complexity and Verification
12. Altmetric Badge
    Chapter 11 Concatenation State Machines and Simple Functions
13. Altmetric Badge
    Chapter 12 FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views
14. Altmetric Badge
    Chapter 13 Finding Finite Automata That Certify Termination of String Rewriting
15. Altmetric Badge
    Chapter 14 Linear Encoding Scheme for Weighted Finite Automata
16. Altmetric Badge
    Chapter 15 The Generalization of Generalized Automata: Expression Automata
17. Altmetric Badge
    Chapter 16 An Automata Approach to Match Gapped Sequence Tags Against Protein Database
18. Altmetric Badge
    Chapter 17 State Complexity of Concatenation and Complementation of Regular Languages
19. Altmetric Badge
    Chapter 18 Minimal Unambiguous ε NFA
20. Altmetric Badge
    Chapter 19 Substitutions, Trajectories and Noisy Channels
21. Altmetric Badge
    Chapter 20 State Complexity and the Monoid of Transformations of a Finite Set
22. Altmetric Badge
    Chapter 21 An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract)
23. Altmetric Badge
    Chapter 22 Time and Space Efficient Algorithms for Constrained Sequence Alignment
24. Altmetric Badge
    Chapter 23 Stochastic Context-Free Graph Grammars for Glycoprotein Modelling
25. Altmetric Badge
    Chapter 24 Parametric Weighted Finite Automata for Figure Drawing
26. Altmetric Badge
    Chapter 25 Regional Finite-State Error Repair
27. Altmetric Badge
    Chapter 26 Approximating Dependency Grammars Through Intersection of Regular Languages
28. Altmetric Badge
    Chapter 27 On the Equivalence-Checking Problem for a Model of Programs Related With Multi-tape Automata
29. Altmetric Badge
    Chapter 28 Tight Bounds for NFA to DFCA Transformations for Binary Alphabets
30. Altmetric Badge
    Chapter 29 Simulating the Process of Gene Assembly in Ciliates
31. Altmetric Badge
    Chapter 30 A BDD-Like Implementation of an Automata Package
32. Altmetric Badge
    Chapter 31 Approximation to the Smallest Regular Expression for a Given Regular Language
33. Altmetric Badge
    Chapter 32 Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory
34. Altmetric Badge
    Chapter 33 Does Hausdorff Dimension Measure Texture Complexity?
35. Altmetric Badge
    Chapter 34 Combining Regular Expressions with (Near-)Optimal Brzozowski Automata
36. Altmetric Badge
    Chapter 35 From Automata to Semilinear Sets: A Logical Solution for Sets $\mathcal{L}$ ( $\mathcal{C}$ , $\mathcal{P}$ )
37. Altmetric Badge
    Chapter 36 Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids
38. Altmetric Badge
    Chapter 37 Minimalizations of NFA Using the Universal Automaton
39. Altmetric Badge
    Chapter 38 Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata
40. Altmetric Badge
    Chapter 39 Size Reduction of Multitape Automata
41. Altmetric Badge
    Chapter 40 Testability of Oracle Automata
42. Altmetric Badge
    Chapter 41 Magic Numbers for Symmetric Difference NFAs