Question

Consider the following operation defined on a language A,Suffix(A)={v∣uv∈A for some string u∈Σ∗ }.Prefix$(A)={u∣uv∈A for some string v∈Σ∗ }.Substring$(A)={x∣uxv∈A for some string u,v∈Σ∗ }.If A is a CFL then which of the above are also CFLs?

Answer 1

Answer:

TUSHAR Chouhan is not able to give answer