Aptitude | GATE CS 1998 | Question 58

[Subjective type]

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 }

 


Answer:

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post



My Personal Notes arrow_drop_up