Solved

A Minimum State Deterministic Finite Automation Accepting the Language L

Question 47

Multiple Choice

A minimum state deterministic finite automation accepting the language L = {W W € {0,1}* , number of 0's and 1's in W are divisible by 3 and 5 respectively has


A) 15 states
B) 11 states
C) 10 states
D) 9 states

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q40: The PDA is called non-deterministic PDA when

Q41: FSM can recognize<br>A)Any grammar<br>B)Only CG<br>C)Both (a) and

Q42: Consider the following Finite State Automaton The

Q43: PCP is:<br>A)Decidable<br>B)Undecidable<br>C)Sometimes Decidable<br>D)None of the

Q44: Which one of the following is true

Q45: Recursively enumerable languages are not closed under<br>A)Union<br>B)homomorphism<br>C)complementation<br>D)concatenation

Q46: Given A = {0,1} and L =

Q48: Let L={w (0 + 1)* w has

Q49: Which of the following statements is/are FALSE?<br>(1)

Q50: Which of the following are decidable?<br>1) Whether