982 views
2 votes
2 votes
Design a NFA and DFA for the following ::

1) Accepting all substrings of the string abab.

2) Accepting all prefixes of the string abab.

3) Accepting all suffixes of the string abab.

1 Answer

Related questions

3 votes
3 votes
1 answer
1
abhinowKatore asked Jan 14, 2023
531 views
Please explain what is difference between $\overline{L(N)}$ and $L(\overline{N}$) ?
0 votes
0 votes
1 answer
2
Lakshman Bhaiya asked Dec 27, 2018
543 views
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�...
1 votes
1 votes
2 answers
3
Shivani gaikawad asked Jun 5, 2018
916 views
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
0 votes
0 votes
2 answers
4
Shivani gaikawad asked Jun 5, 2018
438 views
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