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
Theorem (Myhill-Nerode) A language L ⊆ Σ is recognizable iff ≡L partitions Σ* into ?nitely many Nerode equivalence classes. Proof: For the "only if" direction (that every recogn


As we are primarily concerned with questions of what is and what is not computable relative to some particular model of computation, we will usually base our explorations of langua

conversion from nfa to dfa 0 | 1 ___________________ p |{q,s}|{q} *q|{r} |{q,r} r |(s) |{p} *s|null |{p}

We now add an additional degree of non-determinism and allow transitions that can be taken independent of the input-ε-transitions. Here whenever the automaton is in state 1

If the first three words are the boys down,what are the last three words??

how to find whether the language is cfl or not?

i want to do projects for theory of computation subject what topics should be best.

Let L 3 = {a i bc j | i, j ≥ 0}. Give a strictly 2-local automaton that recognizes L 3 . Use the construction of the proof to extend the automaton to one that recognizes L 3 . Gi

In general non-determinism, by introducing a degree of parallelism, may increase the accepting power of a model of computation. But if we subject NFAs to the same sort of analysis