# Automata: Trying to understand how to check if language is regular

1. Oct 24, 2010

### milena24

1. The problem statement, all variables and given/known data
Prove or Disprove L is regular, where
L = {0$$^{i}$$1$$^{j}$$ | (i$$^{2}$$ + j$$^{2}$$) is square}

2. Relevant equations
N/A

3. The attempt at a solution
I tried using pumping lemma, but I don't know how to assign p if there are two variables (i and j)...

I understand the i$$^{2}$$ + j$$^{2}$$ would be like pythagorean theorem, but I cannot relate the pumping lemma given I've been provided two distinct variables...

Can anyone help and guide me? I am not asking for a full solution, instead a bit of a kickstart