Merging nodes, Theory of Computation

Another striking aspect of LTk transition graphs is that they are generally extremely ine?cient. All we really care about is whether a path through the graph leads to an accepting node or not. From that perspective, there is surely no reason to distinguish the nodes in the region marked H in Figure 2. Every one of these is an accepting node and every path from any one of them leads only to others in the same region. Every string with an initial segment which reaches one of these nodes will be accepted regardless of what the rest of the string looks like.

With a little more thought, it should become clear that the nodes in each of the other regions marked out in the ?gure are equivalent in a similar way. Any path which, when appended to a path leading to any one of the nodes, extends it to a path leading to an accepting state will do the same for paths leading to any node in the same region.

We can characterize the paths leading to the nodes in each region in terms of the components of aa ∧ (¬bb ∨ ba) they satisfy. Paths leading to region H satisfy aa ∧ ba. Strings starting this way will be accepting no matter what occurs in the remainder of the string. Regions D, F and G all satisfy aa. D and F also satisfy ¬bb and, so, are accepting. Paths reaching region G have seen bb and no longer accept until they have been extended with an a, thus satisfying aa ∧ ba and entering region H. We need to distinguish the nodes inregions D and F because paths leading to D end in a and, therefore, can be extended with b harmlessly, while if a path leading to F is extended with b we will no longer accept it.

Posted Date: 3/21/2013 3:25:01 AM | Location : United States







Related Discussions:- Merging nodes, Assignment Help, Ask Question on Merging nodes, Get Answer, Expert's Help, Merging nodes Discussions

Write discussion on Merging nodes
Your posts are moderated
Related Questions
Find the Regular Grammar for the following Regular Expression:                    a(a+b)*(ab*+ba*)b.

The fundamental idea of strictly local languages is that they are speci?ed solely in terms of the blocks of consecutive symbols that occur in a word. We'll start by considering lan

Our primary concern is to obtain a clear characterization of which languages are recognizable by strictly local automata and which aren't. The view of SL2 automata as generators le

We saw earlier that LT is not closed under concatenation. If we think in terms of the LT graphs, recognizing the concatenation of LT languages would seem to require knowing, while

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

Prove that Language is non regular TRailing count={aa ba aaaa abaa baaa bbaa aaaaaa aabaaa abaaaa..... 1) Pumping Lemma 2)Myhill nerode

examples of decidable problems

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

constract context free g ={ a^n b^m : m,n >=0 and n

Trees and Graphs Overview: The problems for this assignment should be written up in a Mircosoft Word document. A scanned hand written file for the diagrams is also fine. Be