adplus-dvertising
frame-decoration

Question

The smallest finite automata which accepts the language {X: X is a word over {a, b} and |x| is Divisible by 3} has

a.

3 states

b.

2 states

c.

4 states

d.

5 states

Answer: (a).3 states

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The smallest finite automata which accepts the language {X: X is a word over {a, b} and |x| is Divisible by 3} has

Similar Questions

Discover Related MCQs

Q. Which of the following is correct?

Q. If a NFA N = (Q,Σ,δ,S,F) and the equilanet DFA D = (Q,Σ,δ,S,F), then which of the following is incorrect?

Q. Complement of (a + b)* will be

Q. a ^ nb ^ m where n >= 1, m >= 1, nm >= 3 is example of

Q. Complement of a ^ nb ^ m where n >= 4 and m <= 3 is example of

Q. a ^ nb ^ n where (n+m) is even .

Q. Which of the following is type 3 language ?

Q. (a ^ 5b ^ 5)* is example of ________

Q. Homomorphism of a regular set is _______

Q. A ___________ is a substitution such that h(a) contains a string for each a.

Q. Reverse of (0+1)* will be

Q. Reverse of a DFA can be formed by

Q. If L1 is regular L2 is unknown but L1-L2 is regular ,then L2 must be

Q. If L1 and L2 are regular sets then intersection of these two will be

Q. Complement of regular sets are _________

Q. Complement of a DFA can be obtained by

Q. Regular sets are closed under union,concatenation and kleene closure.

Q. The number of final states we need as per the given language?
Language L: {an| n is even or divisible by 3}

Q. The e-NFA recognizable languages are not closed under :

Q. The __________ of a set of states, P, of an NFA is defined as the set of states reachable from any state in P following e-transitions.