Register

Peter Linz Edition 4 Exercise 4.2 Question 5 (Page No. 113)

453 views

1 Answer

0 votes
0 votes

We will construct the L^r using:

  1.  Interchange initial and final stage. 
  2.  Reverse the edges direction. 

After constructing the L^r using Equivalence Algorithm of two Regular language we can find whether L=L^r

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

Related questions

0 votes
0 votes
0 answers
1
Naveen Kumar 3 asked Apr 10, 2019
182 views
Peter Linz Edition 4 Exercise 4.2 Question 12 (Page No. 113)
Let $L$ be any regular language on $Σ =$ {$a, b$}. Show that an algorithm exists for determining if $L$ contains any strings of even length.
Let $L$ be any regular language on $Σ =$ {$a, b$}. Show that an algorithm exists for determining if $L$ contains any strings of even length.
User Avatar
0 votes
0 votes
0 answers
2
Naveen Kumar 3 asked Apr 10, 2019
131 views
Peter Linz Edition 4 Exercise 4.2 Question 11 (Page No. 113)
The operation $tail (L)$ is defined as $tail(L)=$ {$v:uv∈L,u,v∈Σ^*$}. Show that there is an algorithm for determining whether or not $L = tail (L)$ for any regular $L$.
The operation $tail (L)$ is defined as $tail(L)=$ {$v:uv∈L,u,v∈Σ^*$}.Show that there is an algorithm for determining whether or not $L = tail (L)$ for any regular $L...
User Avatar
0 votes
0 votes
0 answers
3
Naveen Kumar 3 asked Apr 10, 2019
175 views
Peter Linz Edition 4 Exercise 4.2 Question 10 (Page No. 113)
Show that there is an algorithm to determine if $L = shuffle (L, L)$ for any regular $L$.
Show that there is an algorithm to determine if $L = shuffle (L, L)$ for any regular $L$.
User Avatar
Link Copied!