L={0^p1^q | p=5-q} is this language is regular or not.
My doubt is
Since every finite language is regular and we can see the all possible values of (p,q) will be (0,5),(1,4),(2,3),(3,2),(4,1),(5,0) so the language would be L={11111,01111,00111,00011,00001,00000}
So the language is regular. But somewhere i read that whenever any linear equation come with language then language is not regular.
Please clear my doubt