Let L be the language consisting of all strings of the form , where m and n are positive integers and .
Show that there is no finite-state automaton that accepts L.
That there is no finite-state automaton that accepts language consisting all strings the form .
be a language that contain strings in the form where are positive integers such that .
Let be a language with the string in the form for all and such that .
Then, it is clear that there are infinitely many strings belongs to such that .
Suppose there is a finite-state automaton with states such that the set of states is .
Let be a state of the automaton and are two strings in where
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started