Register

Peter Linz Edition 4 Exercise 1.2 Question 3 (Page No. 27)

171 views

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

1 votes
1 votes
1 answer
1
Naveen Kumar 3 asked Mar 17, 2019
365 views
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
1 votes
1 votes
1 answer
2
Naveen Kumar 3 asked Mar 17, 2019
287 views
Peter Linz Edition 4 Exercise 1.2 Question 1 (Page No. 27)
Use induction on $n$ to show that $|u^n|=n|u|$ for all strings $u$ and all $n$.
Use induction on $n$ to show that $|u^n|=n|u|$ for all strings $u$ and all $n$.
User Avatar
1 votes
1 votes
1 answer
4
Naveen Kumar 3 asked Mar 19, 2019
346 views
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
Link Copied!