non-deterministic finite automaton -- 2
Budget: $10 – $30 USD
1.Show that the following language is regular by finding a non-deterministic finite automaton:
a) L={0n 1m | n is divisible by 3 and m is divisible by 2 or 5}
b) Left most symbol differs from the rightmost.
2.For the regular expression (0+1+2)* 110(11)* find a NFA (possibly with epsilon moves) to accept the RE
a) L={0n 1m | n is divisible by 3 and m is divisible by 2 or 5}
b) Left most symbol differs from the rightmost.
2.For the regular expression (0+1+2)* 110(11)* find a NFA (possibly with epsilon moves) to accept the RE