A minimum state deterministic finite automation accepting the language – McqOptions

MCQOPTIONS

1.	A minimum state deterministic finite automation accepting the language L={W W {0,1}*, number of 0s and 1s in are divisible by 3 and 5, respectively} has
A.	15 states
B.	11 states
C.	10 states
D.	9 states
Answer» B. 11 states

Discussion

No Comment Found

Related MCQs

= { } w has at least as many occurrences of (110) s as (011) s}. Let L {w 0,1 * 2 = { } w has at least as many occurrence of (000) s as (111) s}. Which one of the following is TRUE?
If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is
The following grammarG = (N, T, P, S)N = {S, A, B, C, D, E}T = {a, b, c}P : S aABAB CDCD CEC aCC bbE bc is
The following grammarG = (N, T, P, S)N = {S, A, B, C}T = {a, b, c}P : S aSA bBB cCC a is
The following grammarG = (N, T, P, S)N = {S, A, B}T = {a, b, c}P : S aSaS aAaA bBB bBB c is
Which of the following is true with respect to Kleene s theorem?1 A regular language is accepted by a finite automaton.2 Every language is accepted by a finite automaton or a turingmachine.
Consider the regular language L = (111+111111)*. The minimum number of states inany DFA accepting this language is
How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
The language L = {anbnan n 1} is recognized by
If an effectively solvable problem has answered in yes or no, then this solution is called