Prove that there is no finite-state automaton that accepts the language $L$ consisting of all strings of $x$ 's and $y$ 's of the form $x ^ { n } y ^ { n }$ where $n$ is a positive integer.

Question

Quizplus · Accepted Answer

The Answer of Prove that there is no finite-state automaton that accepts the language $L$ consisting of all strings of $x$ 's and $y$ 's of the form $x ^ { n } y ^ { n }$ where $n$ is a positive integer.

Prove That There Is No Finite-State Automaton That Accepts the Language