Edible Finite Automata
January 15, 2004
DFA for {w | w= is an even binary number with an even number of 1's }
January 15, 2004
States are applesauce muffins.
DFA for {w | w= has an even number of a's and an even number of b's }
January 15, 2004
States are applesauce muffins.
NFA for {ab(ab)*} union {aa*b}
January 15, 2004
States are applesauce muffins.
DFA for {ab(ab)*} union {aa*b}
January 15, 2004
States are applesauce muffins.
Last modified: Wed Apr 7 10:54:20 EDT 2004