Show that it is not possible to construct a finite state machine that recognizes precisely those sequences

Question:

Show that it is not possible to construct a finite state machine that recognizes precisely those sequences in the language A = {0.1 | j ∈ +, i > j}. (Here the alphabet for A is ∑ = {0, 1}.)
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: