Implementation and Application of Automata

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Information Distance and Its Applications
3. Altmetric Badge
   Chapter 2 Theory Inspired by Gene Assembly in Ciliates
4. Altmetric Badge
   Chapter 3 On the State Complexity of Combined Operations
5. Altmetric Badge
   Chapter 4 Path-Equivalent Removals of ε -transitions in a Genomic Weighted Finite Automaton
6. Altmetric Badge
   Chapter 5 Hybrid Extended Finite Automata
7. Altmetric Badge
   Chapter 6 Refinement of Near Random Access Video Coding with Weighted Finite Automata
8. Altmetric Badge
   Chapter 7 Borders and Finite Automata
9. Altmetric Badge
   Chapter 8 Finding Common Motifs with Gaps Using Finite Automata
10. Altmetric Badge
    Chapter 9 Factor Oracles
11. Altmetric Badge
    Chapter 10 Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice
12. Altmetric Badge
    Chapter 11 Tiburon: A Weighted Tree Automata Toolkit
13. Altmetric Badge
    Chapter 12 Around Hopcroft’s Algorithm
14. Altmetric Badge
    Chapter 13 Multi-tape Automata with Symbol Classes
15. Altmetric Badge
    Chapter 14 On the Computation of Some Standard Distances Between Probabilistic Automata
16. Altmetric Badge
    Chapter 15 Does o-Substitution Preserve Recognizability?
17. Altmetric Badge
    Chapter 16 Correctness Preservation and Complexity of Simple RL -Automata
18. Altmetric Badge
    Chapter 17 Bisimulation Minimization of Tree Automata
19. Altmetric Badge
    Chapter 18 Forgetting Automata and Unary Languages
20. Altmetric Badge
    Chapter 19 Structurally Unambiguous Finite Automata
21. Altmetric Badge
    Chapter 20 Symbolic Implementation of Alternating Automata
22. Altmetric Badge
    Chapter 21 On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
23. Altmetric Badge
    Chapter 22 Finite-State Temporal Projection
24. Altmetric Badge
    Chapter 23 Compiling Linguistic Constraints into Finite State Automata
25. Altmetric Badge
    Chapter 24 Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time
26. Altmetric Badge
    Chapter 25 A Family of Algorithms for Non Deterministic Regular Languages Inference
27. Altmetric Badge
    Chapter 26 Implementation and Application of Automata
28. Altmetric Badge
    Chapter 27 A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems
29. Altmetric Badge
    Chapter 28 Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits
30. Altmetric Badge
    Chapter 29 Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
31. Altmetric Badge
    Chapter 30 Lexical Disambiguation with Polarities and Automata
32. Altmetric Badge
    Chapter 31 Parsing computer languages with an automaton compiled from a single regular expression
33. Altmetric Badge
    Chapter 32 Tighter Packed Bit-Parallel NFA for Approximate String Matching