Constructing a Finite State Machine for Recognizing Sequences in Language A

[prevail]

Why is it not possible to construct a finite state machine that recognizes precisely those sequences in the language
A = {0^i 1^j |i,j Element Z^+, i>j} where the alphabet for A is {0,1}..

I just don't get it why this is not possible..

Is it because 0 can be infinite.. ?

 

[matt grime]

0 is 0, 0 is not 'infinite'.

 

[prevail]

yeah i know that, but in a finite state machine... According to the sequence in the language there must be more 0 than 1... (the way I understand it..)