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
What is the purpose of GDTR?

#can you solve a problem of palindrome using turing machine with explanation and diagrams?

One of the first issues to resolve, when exploring any mechanism for defining languages is the question of how to go about constructing instances of the mechanism which define part

The Emptiness Problem is the problem of deciding if a given regular language is empty (= ∅). Theorem 4 (Emptiness) The Emptiness Problem for Regular Languages is decidable. P

When an FSA is deterministic the set of triples encoding its edges represents a relation that is functional in its ?rst and third components: for every q and σ there is exactly one

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

We will specify a computation of one of these automata by specifying the pair of the symbols that are in the window and the remainder of the string to the right of the window at ea

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


Construct a Mealy machine that can output EVEN or ODD According to the total no. of 1''s encountered is even or odd.