Prove the language is not regular


Discuss the below:

Q: Let x be an element of Σ+ be a word. Show that for all such x, the language L=x* is regular. Give an example of x such that the language:

L2/3 = {uw l ∃ y∈L , y=uvw, l u l = l v l = l wl }

is not regular. Prove your answer.

(note: l l is equal to the length)

Solution Preview :

Prepared by a verified Expert
Theory of Computation: Prove the language is not regular
Reference No:- TGS01939518

Now Priced at $20 (50% Discount)

Recommended (96%)

Rated (4.8/5)