Aptitude | GATE CS 1998 | Question 58
Last Updated :
12 Oct, 2017
[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
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...