Register

toc dfa

• edited by
2,606 views
1 votes
1 votes
Construct minimal DFA which accepts set of all srings over {a,b} which starts and ends with the same symbol???
• edited by
User Avatar

1 Answer

Best answer
3 votes
3 votes

dfa diagram 

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Lakshman Bhaiya asked Dec 27, 2018
576 views
Self doubt TOC DFA
Construct a minimal DFA which accepts set of all strings over {a,b}, such that $1)$Second symbol from $RHS$ should be $‘a’$ $2)$Third symbol from $RHS$ should be $‘a’$
Construct a minimal DFA which accepts set of all strings over {a,b}, such that$1)$Second symbol from $RHS$ should be $‘a’$$2)$Third symbol from $RHS$ should be $‘a�...
User Avatar
1 votes
1 votes
2 answers
2
Shivani gaikawad asked Jun 5, 2018
962 views
Toc dfa
The minimum number of state in the DFA for the language $L = \{ w \mid (n_a(w)+2n_b(w))mod \hspace{0.1cm} 3<2 \} $ is
The minimum number of state in the DFA for the language $L = \{ w \mid (n_a(w)+2n_b(w))mod \hspace{0.1cm} 3<2 \} $ is
User Avatar
0 votes
0 votes
2 answers
3
Shivani gaikawad asked Jun 5, 2018
464 views
Toc DFA
The minimum number of state in the DFA for the language $L = \{ w \mid w \in \{a,b\}^* \text{ w has exactly two a's and at least two b's} \}$ is $9$ $10$ $16$ None
The minimum number of state in the DFA for the language $L = \{ w \mid w \in \{a,b\}^* \text{ w has exactly two a's and at least two b's} \}$ is $9$$10$$16$None
User Avatar
2 votes
2 votes
1 answer
4
rahul sharma 5 asked Nov 9, 2017
954 views
TOC :- Number of states in DFA
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
User Avatar
Link Copied!