Register

MADE EASY TEST SERIES

280 views
3 votes
3 votes

Which of the following represents the minimum number of states in DFA for given language :

  • 5 states
  • 6 states
  • 7 states
  • 8 states

I am being able to draw a DFA with 5 states but Made easy says 6 states are required. Please verify.

User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Abhishek3301 asked Feb 6
9 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
3
Rohit Chakraborty asked Oct 5, 2023
461 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
0 votes
0 votes
2 answers
4
jugnu1337 asked Sep 3, 2023
344 views
MADE EASY test series
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
User Avatar
Link Copied!