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
Give the Myhill graph of your automaton. (You may use a single node to represent the entire set of symbols of the English alphabet, another to represent the entire set of decima

You are required to design a system that controls the speed of a fan's rotation. The speed at which the fan rotates is determined by the ambient temperature, i.e. as the temperatur


Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4}

The universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the interpretation for the information carrie

(c) Can you say that B is decidable? (d) If you somehow know that A is decidable, what can you say about B?

The language accepted by a NFA A = (Q,Σ, δ, q 0 , F) is NFAs correspond to a kind of parallelism in the automata. We can think of the same basic model of automaton: an inpu

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

Let L1 and L2 be CGF. We show that L1 ∩ L2 is CFG too. Let M1 be a decider for L1 and M2 be a decider for L2 . Consider a 2-tape TM M: "On input x: 1. copy x on the sec

Lemma 1 A string w ∈ Σ* is accepted by an LTk automaton iff w is the concatenation of the symbols labeling the edges of a path through the LTk transition graph of A from h?, ∅i to