Register

TOC DFA

406 views

1 Answer

Best answer
2 votes
2 votes

I Assume for  $\sum$ ={a,b}

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

Related questions

3 votes
3 votes
1 answer
1
abhinowKatore asked Jan 14, 2023
551 views
DFA | Madeeasy TOC
Please explain what is difference between $\overline{L(N)}$ and $L(\overline{N}$) ?
Please explain what is difference between $\overline{L(N)}$ and $L(\overline{N}$) ?
User Avatar
0 votes
0 votes
1 answer
2
Lakshman Bhaiya asked Dec 27, 2018
575 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
3
Shivani gaikawad asked Jun 5, 2018
960 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
4
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
Link Copied!