// labc.dfa  machine coded for dfa simulation
//
// Machine Definition  M = (Q, Sigma, alpha, q0, F)
// Q = { q0, q1, q2, q3 }     the set of states
// Sigma = { a, b, c }        the input string alphabet
// q0 = q0                    the starting state
// F = { q3 }                 the set of final states (accepting)
//
//                          inputs
//   alpha          |    a    |    b    |    c    |
//         ---------+---------+---------+---------+
//              q0  |   q1    |   phi   |   phi   | phi is no state exists
//              q1  |   phi   |   q2    |   phi   |
//    states    q2  |   phi   |   phi   |   q3    |
//              q3  |   phi   |   phi   |   phi   |
//
//
//  The regular expression for the machine M above is
//    r = abc      just one string
//

start q0
final q3
trace all
limit 10

q0  a  q1   // no typing for transition to phi
q1  b  q2
q2  c  q3

enddef
tape abc
tape acb
tape bbb