50. 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

By ayush goel in 7 Oct 2023 | 03:29 pm
ayush goel

ayush goel

 Student
Posts: 346
Member since: 21 Sep 2023

50. 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
7 Oct 2023 | 03:29 pm
0 Likes

Report

Please describe about the report short and clearly.