Powerset construction, Theory of Computation

Assignment Help:

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.


Related Discussions:- Powerset construction

Abstract model for an algorithm solving a problem, These assumptions hold f...

These assumptions hold for addition, for instance. Every instance of addition has a unique solution. Each instance is a pair of numbers and the possible solutions include any third

Local suffix substitution closure, The k-local Myhill graphs provide an eas...

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

Push down automata, Construct a PDA that accepts { x#y | x, y in {a, b}* su...

Construct a PDA that accepts { x#y | x, y in {a, b}* such that x ? y and xi = yi for some i, 1 = i = min(|x|, |y|) }. For your PDA to work correctly it will need to be non-determin

Finiteness of languages is decidable, To see this, note that if there are a...

To see this, note that if there are any cycles in the Myhill graph of A then L(A) will be infinite, since any such cycle can be repeated arbitrarily many times. Conversely, if the

Pendulum Swings, how many pendulum swings will it take to walk across the c...

how many pendulum swings will it take to walk across the classroom?

What is pumping lemma for regular sets, State & prove pumping lemma for reg...

State & prove pumping lemma for regular set. Show that for the language L={ap |p is a prime} is not regular

Closure properties of recognizable languages, We got the class LT by taking...

We got the class LT by taking the class SL and closing it under Boolean operations. We have observed that LT ⊆ Recog, so certainly any Boolean combination of LT languages will also

DFA, designing DFA

designing DFA

Xx, Ask queyystion #Minimum 100 words accepted#

Ask queyystion #Minimum 100 words accepted#

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