Question: For a language L over alphabet , we define L = {xz *y * with |x| = |y| = |2| such that ryz L}.
For a language L over alphabet , we define L = {xz *y * with |x| = |y| = |2| such that ryz L}. For example, if L = {a, to, cat, math, solve, theory}, then L = {ct,thry}. Prove that if L is regular, then L-1 need not be regular. Hint: Consider the language 0*21* and recall closure properties of regular languages
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
