Register

DFA: No of states

495 views

3 Answers

1 votes
1 votes
Asnswer will be 2.Start state as final state and one more state to loop back.
User Avatar
0 votes
0 votes
Two states is enough(one for even length string and another for odd length string)

and we make final state which accept even length string
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
hacker16 asked Dec 17, 2017
295 views
No of states in Min DFA
No of states in Min DFA, that accepts (1)* over {0,1} alphabets is 1 states 2 states None of these
No of states in Min DFA, that accepts (1)* over {0,1} alphabets is1 states2 statesNone of these
User Avatar
2 votes
2 votes
2 answers
3
Tuhin Dutta asked Nov 30, 2017
1,072 views
DFA no of states
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
User Avatar
1 votes
1 votes
1 answer
4
Prajwal Bhat asked Jan 17, 2017
1,360 views
Minimum No of states in DFA
No. of states in the DFA accepting the following set of strings are: ( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )* Quite confusing to me. Share your approach!
No. of states in the DFA accepting the following set of strings are:( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )*Quite confusing to me. Share your approach!
User Avatar
Link Copied!