Solved

A Minimum State Deterministic Finite Automation Accepting the Language L

Question 6

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

Q1: Let SHAM3 be the problem of finding

Q2: S -> aSa| bSb| a| b ;

Q3: Consider the languages: L<sub>1</sub> ={a^n b^n c^m

Q4: Consider the languagesL<sub>1</sub>={0^{i}1^{j}|i != j},L<sub>2</sub>={0^{i}1^{j}|i = j},L<sub>3</sub>

Q5: Let L<sub>1</sub> be a recursive language. Let

Q7: If s is a string over (0

Q8: Consider the following two problems on undirected

Q9: Consider the set of strings on

Q10: For S € (0+1)* let d(s)denote the

Q11: Consider the language L<sub>1</sub>,L<sub>2</sub>,L<sub>3</sub> as given below.<br>L<sub>1</sub>={0^{p}1^{q}