How can I use the pumping lemma for context-free language in a language with two alphabets?

68 Views Asked by At

$G =\{aba\mid a\in \{x,y,z\}{^+}\text{ and } b \in \{0,1\}\}$

I have watched many videos but I never saw an example of someone solving a pumping lemma in a language with two alphabets, can someone give me a example or some guidance? I need to prove if it is a context free language, there are other ways?