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
Exercise:  Give a construction that converts a strictly 2-local automaton for a language L into one that recognizes the language L r . Justify the correctness of your construction.

In general non-determinism, by introducing a degree of parallelism, may increase the accepting power of a model of computation. But if we subject NFAs to the same sort of analysis

DEGENERATE OF THE INITIAL SOLUTION

Question 2 (10 pt): In this question we look at an extension to DFAs. A composable-reset DFA (CR-DFA) is a five-tuple, (Q,S,d,q0,F) where: – Q is the set of states, – S is the alph

I want a proof for any NP complete problem

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

let G=(V,T,S,P) where V={a,b,A,B,S}, T={a,b},S the start symbol and P={S->Aba, A->BB, B->ab,AB->b} 1.show the derivation sentence for the string ababba 2. find a sentential form

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

. On July 1, 2010, Harris Co. issued 6,000 bonds at $1,000 each. The bonds paid interest semiannually at 5%. The bonds had a term of 20 years. At the time of issuance, the market r

The Last Stop Boutique is having a five-day sale. Each day, starting on Monday, the price will drop 10% of the previous day’s price. For example, if the original price of a product