8. Finite Automaton Review
• If M reads input character “a” when in state q, then it
changes to state (q, a).
• If its currents state q is in A, then M is said to accept the
string read so far.
• M induces a function : * Q, called the final-state
function, such that (w) is the state of M after reading the
string w. can be defined recursively as follows:
() = q0
(wa) = ((w), a)
• Therefore, M accepts w if and only if (w) A.
Dr. AMIT KUMAR @JUET 8
9. The Suffix Function
In order to properly
search for the string, the
program must define a
suffix function ( )
which checks to see
how much of what it is
reading matches the
search string at any
given moment.
Dr. AMIT KUMAR @JUET 9
