1 votes 1 votes Consider the NFA below: The above NFA acceptes all those binary strings which represents the decimal numbers and are a. divisible by 6 only b. dividible by 2 and 3 only c. divisible by 2 or 3 d. None of these Theory of Computation theory-of-computation regular-language + – Mahesha999 asked Dec 25, 2016 • retagged Jun 4, 2017 by Arjun Mahesha999 1.9k views answer comment Share Follow See 1 comment See all 1 1 comment reply Prateek Yadav 2 commented Dec 25, 2016 reply Follow Share is it answer c?? 0 votes 0 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes Ans. C. For option A: It will accept numbers divisivle by 6, but not 6 only. (will accept 4, 8, ...) For option B: It will accept number divisible by 2 and 3, but not 2 and 3 only ( will accept 9, which is divisible by 3 but not but 2) Otion C: it accept numbers which are either divisble by 2 or 3 (All numbers divisibile by this NFA is divisible by either 2 or 3 or both.) Manu Madhavan answered Dec 26, 2016 • selected Dec 27, 2016 by Mahesha999 Manu Madhavan comment Share Follow See all 2 Comments See all 2 2 Comments reply Mahesha999 commented Dec 26, 2016 reply Follow Share but it does not accept string 10. 10 will end up the NFA in state $q_5$. Then how can we say that it "accepts **all** those binary strings which represents the decimal numbers and are divisible by 2 or 3" 0 votes 0 votes Manu Madhavan commented Dec 27, 2016 reply Follow Share Instead of 10, if 2 is represented as 010 it will accept. Otherwise it will not accept (that means None of these will be the answer). 0 votes 0 votes Please log in or register to add a comment.