Theory of Computation
toc
1 A Hybrid Indexing Method for Approximate String Matching Journal of Discrete Algorithms, No. 1, Vol. 1, 2000, pp. 205-239, Gonzalo Navarro and Ricardo.
1 Approximate string matching using factor automata J. Holub and B. Melichar Theoretical Computer Science vol.249 p.305-311 Speaker: L. C. Chen Advisor:
Automata Theory CS 3313 Chapter 4 An Introduction to Finite Automata.
Restricted Machines Presented by Muhannad Harrim.
String Matching with Finite Automata,Aho corasick,
CS1303_Theory_of_computation
Finite automata examples
NFA or Non deterministic finite automata
Tutorial 1
Nondeterministic Finite Automata CS 130: Theory of Computation HMU textbook, Chapter 2 (Sec 2.3 & 2.5)
