Finiteness of languages is decidable, Theory of Computation

Assignment Help:

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.


Related Discussions:- Finiteness of languages is decidable

Java programming, 1. An integer is said to be a “continuous factored” if it...

1. An integer is said to be a “continuous factored” if it can be expresses as a product of two or more continuous integers greater than 1. Example of continuous factored integers

Non - sl languages, Application of the general suffix substitution closure ...

Application of the general suffix substitution closure theorem is slightly more complicated than application of the specific k-local versions. In the specific versions, all we had

Prepare the consolidated financial statements, Prepare the consolidated fin...

Prepare the consolidated financial statements for the year ended 30 June 2011. On 1 July 2006, Mark Ltd acquired all the share capitall of john Ltd for $700,000. At the date , J

#titl, matlab v matlab

matlab v matlab

Can you help me in automata questions, i have some questions in automata, c...

i have some questions in automata, can you please help me in solving in these questions?

Transition graphs, We represented SLk automata as Myhill graphs, directed g...

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

Automata answer, build a TM that enumerate even set of even length string o...

build a TM that enumerate even set of even length string over a

Find regular grammar : a(a+b)*(ab*+ba*)b, Find the Regular Grammar for the ...

Find the Regular Grammar for the following Regular Expression:                    a(a+b)*(ab*+ba*)b.

Finiteness problem for regular languages, The fact that the Recognition Pro...

The fact that the Recognition Problem is decidable gives us another algorithm for deciding Emptiness. The pumping lemma tells us that if every string x ∈ L(A) which has length grea

Strictly local generation automaton, Another way of interpreting a strictly...

Another way of interpreting a strictly local automaton is as a generator: a mechanism for building strings which is restricted to building all and only the automaton as an inexh

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd