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
We represented SLk automata as Myhill graphs, directed graphs in which the nodes were labeled with (k-1)-factors of alphabet symbols (along with a node labeled ‘?' and one labeled

spam messages h= 98%, m= 90%, l= 80% non spam h=12%, m = 8%, l= 5% The organization estimates that 75% of all messages it receives are spam messages. If the cost of not blocking a

what problems are tackled under numerical integration

The path function δ : Q × Σ*→ P(Q) is the extension of δ to strings: Again, this just says that to ?nd the set of states reachable by a path labeled w from a state q in an

can you plz help with some project ideas relatede to DFA or NFA or anything

When we say "solved algorithmically" we are not asking about a speci?c programming language, in fact one of the theorems in computability is that essentially all reasonable program

Suppose A = (Q,Σ, T, q 0 , F) is a DFA and that Q = {q 0 , q 1 , . . . , q n-1 } includes n states. Thinking of the automaton in terms of its transition graph, a string x is recogn

Automata and Compiler (1) [25 marks] Let N be the last two digits of your student number. Design a finite automaton that accepts the language of strings that end with the last f

Construct a PDA that accepts { x#y | x, y in {a, b}* such that x ? y and xi = yi for some i, 1 = i = min(|x|, |y|) }. For your PDA to work correctly it will need to be non-determin

Given any NFA A, we will construct a regular expression denoting L(A) by means of an expression graph, a generalization of NFA transition graphs in which the edges are labeled with