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
The class of Strictly Local Languages (in general) is closed under • intersection but is not closed under • union • complement • concatenation • Kleene- and positive

Let ? ={0,1} design a Turing machine that accepts L={0^m 1^m 2^m } show using Id that a string from the language is accepted & if not rejected .

So we have that every language that can be constructed from SL languages using Boolean operations and concatenation (that is, every language in LTO) is recognizable but there are r

Intuitively, closure of SL 2 under intersection is reasonably easy to see, particularly if one considers the Myhill graphs of the automata. Any path through both graphs will be a

The objective of the remainder of this assignment is to get you thinking about the problem of recognizing strings given various restrictions to your model of computation. We will w

Strictly 2-local automata are based on lookup tables that are sets of 2-factors, the pairs of adjacent symbols which are permitted to occur in a word. To generalize, we extend the

#can you solve a problem of palindrome using turing machine with explanation and diagrams?

Describe the architecture of interface agency

The generalization of the interpretation of strictly local automata as generators is similar, in some respects, to the generalization of Myhill graphs. Again, the set of possible s

a) Let n be the pumping lemma constant. Then if L is regular, PL implies that s can be decomposed into xyz, |y| > 0, |xy| ≤n, such that xy i z is in L for all i ≥0. Since the le