Answer Happy

[Alogrithm] Finite Automata
Q. Write the process of matching the pattern P for the
following text T.
P =
T =
FA-Matcher (A, 6, f) { //f: target states //n: length of array A[] //6: state //q: Transition Functions q = 0; for i 1 to n { q6(q, A); if(q=f) then matching on A[i-m+1] } }