October 4, 2023
Theory-of-Computation
October 4, 2023DFA
|
Question 1
|
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 5}
|
Theory Explanation.
|
Correct Answer: A