closed by
846 views
1 votes
1 votes

Let L be a given context-free language over the alphabet {a, b}. Construct L1, L2 as follows.
Let L1 = L − {xyx | x, y ∈ {a, b}},
and L2 = L·L. Then,

(A) Both L1 and L2 are regular.

B) Both L1 and L2 are context free but not necessarily regular.

(C) L1 is regular and L2 is context free.

(D) L1 and L2 both may not be context free 

closed by

Related questions

0 votes
0 votes
0 answers
1
hacker16 asked Dec 18, 2017
697 views
Let Ʃ = {a, b} and L = {anwan | n ≥ 1, w ∈ Ʃ*}.ThenL is context free but not regularL is not context free but regularL is context free as well as regularL is neithe...