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
design a tuning machine for penidrome

Give the Myhill graph of your automaton. (You may use a single node to represent the entire set of symbols of the English alphabet, another to represent the entire set of decima

https://www.google.com/search?q=The+fomula+n%3D%28x%3D0%29%2F%281%3D2%29.The+value+x%3D0+and+is+used+to+stop+the+algerithin.The+calculation+is+reapeated+using+values+of+x%3D0+is+in

Different types of applications and numerous programming languages have been developed to make easy the task of writing programs. The assortment of programming languages shows, dif

The initial ID of the automaton given in Figure 3, running on input ‘aabbba' is (A, aabbba) The ID after the ?rst three transitions of the computation is (F, bba) The p

Claim Under the assumptions above, if there is an algorithm for checking a problem then there is an algorithm for solving the problem. Before going on, you should think a bit about


(c) Can you say that B is decidable? (d) If you somehow know that A is decidable, what can you say about B?

Proof (sketch): Suppose L 1 and L 2 are recognizable. Then there are DFAs A 1 = (Q,Σ, T 1 , q 0 , F 1 ) and A 2 = (P,Σ, T 2 , p 0 , F 2 ) such that L 1 = L(A 1 ) and L 2 = L(

The key thing about the Suffx Substitution Closure property is that it does not make any explicit reference to the automaton that recognizes the language. While the argument tha