Register

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

915 views

1 Answer

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,991 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,534 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
2 votes
2 votes
1 answer
4
Naveen Kumar 3 asked Mar 19, 2019
4,142 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!