Solved

A Minimum State Deterministic Finite Automation Accepting the Language L={W

Question 50

Multiple Choice

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

Correct Answer:

verifed

Verified

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

Related Questions

Q40: The following grammar<br>G = (N, T, P,

Q41: Which of the following statement is wrong?<br>A)Any

Q42: Which one of the following languages over

Q43: A language is regular if and only

Q44: P, Q, R are three languages. If

Q45: The following CFG is in S ?

Q46: A?abA a type _productions<br>A)Type 0<br>B)Type 1<br>C)Type 2<br>D)Type

Q47: "S ?a S", what is the type

Q48: Which of the statements is true:<br>A)The complement

Q49: How many strings of length less than