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 does not exist any finite-state automaton which accepts all the strings in the form .
The language consisting only the strings in the form where and are positive integers and
Suppose there is a finite-state automaton such that accept the string where and
Then, we can observe that from the initial state, the automaton accept number of ’s as inputs in a row and next number of ’s in a row and then it reaches to the accepting state.
Notice that, and are integers and
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started