# Homework example 2
# From Sipser & MIT's automata course
states:   [ 1, 2, 3 ]
alphabet: [ a, b ]
start:      1
accept:   [ 2 ]
transitions : 
  #   state x alpha -> state
  - [ 1,      ~,       2 ]
  - [ 1,      a,       3 ]
  - [ 2,      a,       1 ]
  - [ 3,      b,       3 ]
  - [ 3,      [a,b],   2 ]
tests :
  - [ yes,      ]
  - [ yes,  aa  ]
  - [ yes,  a   ]
  - [ yes,  ab  ]
  - [ yes,  abb ]
  - [ no,   b   ]
  - [ no,   ba  ]
#
#
# reg ex: ( ab*(a|B)|~ ) ( ~ | a(ab*(a|b)|~) )*
# (from solution set from MIT folks)
