...
October 4, 2023
Theory-of-Computation
October 4, 2023
October 4, 2023
Theory-of-Computation
October 4, 2023

DFA

Question 2

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}

A
Theory Explanation.
Correct Answer: A

Leave a Reply

Your email address will not be published. Required fields are marked *