non-deterministic finite automaton
Budget: $10 – $30 USD
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.
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.