- #1
prevail
- 17
- 0
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.. :grumpy:
Is it because 0 can be infinite.. ?
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.. :grumpy:
Is it because 0 can be infinite.. ?