Answered step by step
Verified Expert Solution
Question
1 Approved Answer
If L is any regular language, let L2/3 be the language in which the middle thirds of strings in L are removed: L2/3 = {
If L is any regular language, let L2/3 be the language in which the middle thirds of strings in L are removed:
L2/3 = { xz | xyz in L and |x| = |y| = |z|, for some y}.
Prove that if L is regular, L2/3 is not necessarily regular.
HINT: A good (clever) counter-example might do the trick. If E = (000)* is regular (it is after all a regex), is E2/3? What if we used a marker, i.e., what if E = (101)* or (100)* or (101)*?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started