Register

Peter Linz Edition 4 Exercise 2.1 Question 8.c (Page No. 47)

• edited by
2,145 views
1 votes
1 votes
how to draw dfa for this?

L= {w: there are at most two runs of a’s of length three}.
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
6 answers
2
Naveen Kumar 3 asked Mar 19, 2019
9,994 views
Peter Linz Edition 4 Exercise 2.1 Question 6 (Page No. 47)
With $Σ = \{a,b\},$ give a DFA for $L = \{w_1aw_2: |w_1|\geq 3, |w_2|\leq 5\}.$
With $Σ = \{a,b\},$ give a DFA for $L = \{w_1aw_2: |w_1|\geq 3, |w_2|\leq 5\}.$
User Avatar
4 votes
4 votes
1 answer
3
Naveen Kumar 3 asked Mar 19, 2019
4,536 views
Peter Linz Edition 4 Exercise 2.1 Question 5 (Page No. 47)
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\}^* \}$
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\}^* \}$
User Avatar
0 votes
0 votes
1 answer
4
Naveen Kumar 3 asked Mar 19, 2019
917 views
Peter Linz Edition 4 Exercise 2.1 Question 3 (Page No. 47)
$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, the resulting dfa accepts $\bar{L}$
$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...
User Avatar
Link Copied!