Finiteness of languages is decidable, Theory of Computation

To see this, note that if there are any cycles in the Myhill graph of A then L(A) will be infinite, since any such cycle can be repeated arbitrarily many times. Conversely, if the Myhill graph is acyclic, then no path from x to x can be longer than card(Σ) + 2, since otherwise some node would have to occur at least twice in the path.

The question of finiteness of L(A), then, can be reduced to the question of acyclicity of the corresponding Myhill graph. And we established that there is an algorithm for testing acyclicity of graphs in Algorithms and Data Structures. Our algorithm for deciding finiteness of L(A) just interprets A as a graph and calls the algorithm for deciding acyclicity as a subroutine.

Posted Date: 3/21/2013 6:04:45 AM | Location : United States







Related Discussions:- Finiteness of languages is decidable, Assignment Help, Ask Question on Finiteness of languages is decidable, Get Answer, Expert's Help, Finiteness of languages is decidable Discussions

Write discussion on Finiteness of languages is decidable
Your posts are moderated
Related Questions


Ask queyystion #Minimum 100 words accepted#

This was one of the ?rst substantial theorems of Formal Language Theory. It's maybe not too surprising to us, as we have already seen a similar equivalence between LTO and SF. But




Strictly 2-local automata are based on lookup tables that are sets of 2-factors, the pairs of adjacent symbols which are permitted to occur in a word. To generalize, we extend the

Exercise:  Give a construction that converts a strictly 2-local automaton for a language L into one that recognizes the language L r . Justify the correctness of your construction.

Computations are deliberate for processing information. Computability theory was discovered in the 1930s, and extended in the 1950s and 1960s. Its basic ideas have become part of