toc doubt, how to tell if a language is regular or not?
eg like 1.{wxw$^r$ | w,x ϵ {a,b}$^*$} this is regular as if we substitute w=w$^r$ with ϵ then only x will remain and generate all languages.
but 2. {wxw$^r$ | w,x ϵ {a,b}$^+$} here we can’t substitute ϵ so how this is regular?