• retagged by
2,546 views
1 1 vote

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

1 Answer

Best answer
0 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.)
• selected by
Position:
Show:

Related questions

2 2 votes
3 answers 3 answers
2.1k
2.1k views
Akash Kanase asked Dec 1, 2015
2,085 views
Identify the language accepted by the following NFA with $\in$-moves.All strings over a's and b'sAll strings which do not contain aaAll strings which do not contain bbNon...
1 1 vote
1 answers 1 answer
1.7k
1.7k views
GateAspirant999 asked Mar 2, 2018
1,724 views
Language accepted by following NFA and number of states in DFA accepting that Language are:$\{a^n|n=2k,kϵN\}$ and 2$\{a^{2n}|n=2k,kϵN\}$ and 2$\{a^n|n=2k,kϵ N\}$ and 3$\{...
2 2 votes
2 answers 2 answers
945
945 views
radha gogia asked Nov 21, 2015
945 views
I am having problem while converting it into NFA since it is an epsilon-NFA , so I got q0 {q0,q1,q2} on a q1 - {q0,q1,q2} on a then finally for DFA I got {q0,q1,q2} and...
0 0 votes
2 answers 2 answers
1.2k
1.2k views