Merging nodes, Theory of Computation

Assignment Help:

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.


Related Discussions:- Merging nodes

Agents architecture, Describe the architecture of interface agency

Describe the architecture of interface agency

Dfa to re, c program to convert dfa to re

c program to convert dfa to re

Non - sl languages, The key thing about the Suffx Substitution Closure prop...

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

Strictly k-local automata, Strictly 2-local automata are based on lookup ta...

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

Turing, turing machine for prime numbers

turing machine for prime numbers

Positiveness problem - decision problems, For example, the question of whet...

For example, the question of whether a given regular language is positive (does not include the empty string) is algorithmically decidable. "Positiveness Problem". Note that

Binary form and chomsky normal form, Normal forms are important because the...

Normal forms are important because they give us a 'standard' way of rewriting and allow us to compare two apparently different grammars G1  and G2. The two grammars can be shown to

Answer, And what this money. Invovle who it involves and the fact of,how we...

And what this money. Invovle who it involves and the fact of,how we got itself identified candidate and not withstanding time date location. That shouts me media And answers who''v

Pumping lemma constant, a) Let n be the pumping lemma constant. Then if L i...

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

Pojects idea, i want to do projects for theory of computation subject what ...

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

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