Powerset construction, Theory of Computation

As de?ned the powerset construction builds a DFA with many states that can never be reached from Q′0. Since they cannot be reached from Q′0 there is no path from Q′0 to a state in F′ which passes through them and they can be deleted from the automaton without changing the language it accepts. In practice it is much easier to build Q′ as needed, only including those state sets that actually are needed.

To see how this works, lets carry out an example. For maximum generality, let's start with the NFA with ε-transitions given above, repeated here:

1876_Powerset Construction.png

Because it is simpler to write the transition function (δ) out as a table than it is to write out the transition relation (T) as a set of tuples, we will work with the δ representation. When given a transition graph of an NFA with ε-transitions like this there are 6 steps required to reduce it to a DFA:

1. Write out the transition function and set of ?nal states of the NFA.

2. Convert it to an NFA without ε-transitions.

(a) Compute the ε-Closure of each state in the NFA.

(b) Compute the transition function of the equivalent NFA without ε-transitions.

(c) Compute the set of ?nal states of the equivalent NFA without ε- transitions.

Posted Date: 3/21/2013 2:58:20 AM | Location : United States







Related Discussions:- Powerset construction, Assignment Help, Ask Question on Powerset construction, Get Answer, Expert's Help, Powerset construction Discussions

Write discussion on Powerset construction
Your posts are moderated
Related Questions
draw pda for l={an,bm,an/m,n>=0} n is in superscript

Generate 100 random numbers with the exponential distribution lambda=5.0.What is the probability that the largest of them is less than 1.0?

distinguish between histogram and historigram

1. An integer is said to be a “continuous factored” if it can be expresses as a product of two or more continuous integers greater than 1. Example of continuous factored integers

This close relationship between the SL2 languages and the recognizable languages lets us use some of what we know about SL 2 to discover properties of the recognizable languages.

The k-local Myhill graphs provide an easy means to generalize the suffix substitution closure property for the strictly k-local languages. Lemma (k-Local Suffix Substitution Clo


design a turing machine that accepts the language which consists of even number of zero''s and even number of one''s?

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

The fact that the Recognition Problem is decidable gives us another algorithm for deciding Emptiness. The pumping lemma tells us that if every string x ∈ L(A) which has length grea