Register

Recent questions tagged peter-linz-edition4

4 votes
1 answer
309
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
1 answer
310
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
0 votes
0 answers
316
Peter Linz Edition 4 Exercise 1.2 Question 15 (Page No. 29)
Find grammars for the following languages on Σ = {a}. (a) L = {w : |w| mod 3 = 0}. (b) L = {w : |w| mod 3 > 0}. (c) L = {w : |w| mod 3 ≠ |w| mod 2}. (d) L = {w : |w| mod 3 ≥ |w| mod 2}.
Find grammars for the following languages on Σ = {a}.(a) L = {w : |w| mod 3 = 0}.(b) L = {w : |w| mod 3 0}.(c) L = {w : |w| mod 3 ≠ |w| mod 2}.(d) L = {w : |w| mod 3 ...
User Avatar
0 votes
2 answers
319
Peter Linz Edition 4 Exercise 1.2 Question 12 (Page No. 28)
Give a simple description of the language generated by the grammar with productions $S \rightarrow aA,$ $A \rightarrow bS,$ $S \rightarrow λ.$
Give a simple description of the language generated by the grammar with productions$S \rightarrow aA,$$A \rightarrow bS,$$S \rightarrow λ.$
User Avatar
1 votes
1 answer
321
Peter Linz Edition 4 Exercise 1.2 Question 10 (Page No. 28)
Prove or disprove the following claims. (a) $(L_1 ∪ L_2)^R = L_1^R ∪ L_2^R$ for all languages $L_1$ and $L_2$. (b) $(L^R)^* = (L^*)^R$ for all languages $L$.
Prove or disprove the following claims.(a) $(L_1 ∪ L_2)^R = L_1^R ∪ L_2^R$ for all languages $L_1$ and $L_2$.(b) $(L^R)^* = (L^*)^R$ for all languages $L$.
User Avatar
2 votes
2 answers
327
Peter Linz Edition 4 Exercise 1.2 Question 4 (Page No. 28)
Let $L$={$ab,aa,baa$}. Which of the following strings are in $L^*$ : $abaabaaabaa$, $aaaabaaaa$, $baaaaabaaaab$, $baaaaabaa$? Which strings are in $L^4$?
Let $L$={$ab,aa,baa$}.Which of the following strings are in $L^*$ :$abaabaaabaa$, $aaaabaaaa$, $baaaaabaaaab$, $baaaaabaa$? Which strings are in $L^4$?
User Avatar
1 votes
1 answer
329
Peter Linz Edition 4 Exercise 1.2 Question 2 (Page No. 27)
The reverse of a string can be defined more precisely by the recursive rules $a^R=a$, $(wa)^R=aw^R$, for all $a∈Σ$, $w∈Σ^*$. Use this to prove that$(uv)^R=v^Ru^R$, for all $u,v∈Σ^+$.
The reverse of a string can be defined more precisely by the recursive rules $a^R=a$,$(wa)^R=aw^R$, for all $a∈Σ$, $w∈Σ^*$.Use this to prove that$(uv)^R=v^Ru^R$, fo...
User Avatar
Page: