Pseudocode

Pseudocode for a table-driven implementation is straightforward. For the current state and input ch, table[state][ch] is the next state.

get a string
ch = first character of string
state = q0;

while ( characters remain in the string && not in reject state )
{
  state = table[state][ch];       
  ch = next character of string 
}

if ( state==q2 && no more characters in string )
  string is accepted
else
  string is rejected

For example, with the input string "abac" the state changes from

• q0 to q1
• q1 to q0
• q0 to q1
• q1 to q2

The final state is reached when the string is exhausted, so the string is accepted.