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

matlab v matlab

When an FSA is deterministic the set of triples encoding its edges represents a relation that is functional in its ?rst and third components: for every q and σ there is exactly one

#Your company has 25 licenses for a computer program, but you discover that it has been copied onto 80 computers. You informed your supervisor, but he/she is not willing to take an


The fact that regular languages are closed under Boolean operations simpli?es the process of establishing regularity of languages; in essence we can augment the regular operations

Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4}

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

Construct a Mealy machine that can output EVEN or ODD According to the total no. of 1''s encountered is even or odd.