Suppose we want to build a finite machine that accepts all words in the language 0(1+0)*. q0q0 1 q1q1 0 0,1 q2q2 FINITE AUTOMATA MACHINES AND THEIR LA