Design a deterministic finite state automaton (using minimum number of states)…
PYQ GATE 1998
Design a deterministic finite state automaton (using minimum number of states) that recognizes the following language:
L = {w ∈ {0, 1}* | w interpreted as a binary number (ignoring the leading zeros) is divisible by five}.
Sign up free to check your answer
Sign up freeLoading lesson…

