Register

No of states in DFA

610 views
0 votes
0 votes

Which of the following represents the minimum number of states in DFA for following language
L={ anb | n≥0 } U { bna | n≥1 }
a. 5 states
b. 6 states
c. 7 states
d. 8 states

User Avatar

2 Answers

0 votes
0 votes
6 states.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
sumit goyal 1 asked Jan 9, 2018
789 views
minimum no. of states in dfa in which no. of "a" divisible by 8
I can use 4 state dfa for no. of a should be divisible by 4 then minimum = 4 , or we have to construct dfa with 8 states ??
I can use 4 state dfa for no. of a should be divisible by 4 then minimum = 4 , or we have to construct dfa with 8 states ??
User Avatar
0 votes
0 votes
0 answers
3
hacker16 asked Dec 17, 2017
294 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
1 votes
1 votes
1 answer
4
Prajwal Bhat asked Jan 17, 2017
1,356 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!