Proving a language is nonregular with Myhill-Nerode theorem

132 Views Asked by At

I am trying to figure out how to prove a language that is nonregular with using Myhill-Nerode theorem.

Here I have

x^​n y^​n x^​n = {xyx xxyyxx xxxyyyxxx ...}

How would I be able to do this ? Would I just say , the language is nonregular because here we observe that the strings xyx xxyyxx xxxyyyxxx... are all in different classes ?