Register

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

4,535 views

1 Answer

9 votes
9 votes

......

• edited by
User Avatar
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
0 votes
0 votes
1 answer
3
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
2 votes
2 votes
1 answer
4
Naveen Kumar 3 asked Mar 19, 2019
4,145 views
Peter Linz Edition 4 Exercise 2.1 Question 2 (Page No. 47)
For $Σ$= {$a,b$}, construct dfa's that accept the sets consisting of (a) all strings with exactly one $a$, (b) all strings with at least one $a$, (c) all strings with no more than three $a$'s
For $Σ$= {$a,b$}, construct dfa's that accept the sets consisting of(a) all strings with exactly one $a$,(b) all strings with at least one $a$,(c) all strings with no mo...
User Avatar
Link Copied!