Let L be the language consisting of all strings of the form
Show that there is no finite-state automaton that accepts L.
To prove:
That there does not exist any finite-state automaton which accepts all the strings in the form
Given information:
The language
Proof:
Suppose there is a finite-state automaton such that accept the string
Then, we can observe that from the initial state, the automaton accept
Notice that,