This is automata question. Please dont copy from other sources and give step by step solution.

[answerhappygod]

This is automata question. Please dont copy from other sources
and give step by step solution.

This Is Automata Question Please Dont Copy From Other Sources And Give Step By Step Solution 1 (16.59 KiB) Viewed 25 times

Let Σ = = {0,1} be an alphabet, L CE* a CFL and, we X* a string. Prove that the language L1 = {ve L | v does not contain 0Ow11 as subtring}