edited by
4,053 views

1 Answer

Related questions

4 votes
4 votes
6 answers
2
4 votes
4 votes
1 answer
3
Naveen Kumar 3 asked Mar 19, 2019
4,412 views
Give dfa's for the languages$L= \{ab^5wb^2 : w ∈ \{a,b\}^* \}$$L= \{ab^na^m : n ≥ 2 , m ≥3\}$ $L = \{w_1abw_2 : w_1 ∈ \{a,b\}^*,w_2 ∈ \{a,b\}^* \}$
0 votes
0 votes
1 answer
4
Naveen Kumar 3 asked Mar 19, 2019
876 views
$L$ = {$awa : w ∈$ {$a,b$}* }Show that if we change the following figure, making $q_3$ a nonfinal state and making $q_0, q_1,q_2$ final states, theresulting dfa accepts...