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
construct a social network from the real-world data, perform some simple network analyses using Gephi, and interpret the results.

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

https://www.google.com/search?q=The+fomula+n%3D%28x%3D0%29%2F%281%3D2%29.The+value+x%3D0+and+is+used+to+stop+the+algerithin.The+calculation+is+reapeated+using+values+of+x%3D0+is+in

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

1. Does above all''s properties can be used to prove a language regular? 2..which of the properties can be used to prove a language regular and which of these not? 3..Identify one

De?nition (Instantaneous Description) (for both DFAs and NFAs) An instantaneous description of A = (Q,Σ, δ, q 0 , F) , either a DFA or an NFA, is a pair h q ,w i ∈ Q×Σ*, where

How useful is production function in production planning?

The Myhill-Nerode Theorem provided us with an algorithm for minimizing DFAs. Moreover, the DFA the algorithm produces is unique up to isomorphism: every minimal DFA that recognizes

how to convert a grammar into GNF

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