in slide 18 of this lecture we build Mw- we want to show that if M does not accept w than Mw accepts a non-regular language. the first thing we do is check if X is of the format o^n1^n and Mw accepts if it is, but what if M does accept w? than Mw accepts a non-reguar language even though M does accept w. why is this OK?