Register

Made Easy Test Series: DFA

625 views

1 Answer

Best answer
1 votes
1 votes
i Think the ans. should be 5 only following stated are merging.

(Q3,Q5) (Q2,Q4)  and rest of the states are single.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
srestha asked Apr 23, 2019
972 views
Made Easy Test Series:TOC-DFA
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________ Answer will be $3$ or $6?$
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________Answer will be...
User Avatar
0 votes
0 votes
1 answer
2
Abhishek3301 asked Feb 6
7 views
Made-easy test series
Number of states in a minimal deterministic finite automata that accepts the language L = {(a + b) a* b*} What should be the answer to this question?
Number of states in a minimal deterministic finite automata that accepts the language L = {(a + b) a* b*} What should be the answer to this question?
User Avatar
0 votes
0 votes
1 answer
4
Rohit Chakraborty asked Oct 5, 2023
456 views
Made easy test series
Please explain the why A and D are correct?
Please explain the why A and D are correct?
User Avatar
Link Copied!