Home > Theory Of Computation > Conversion Of E-NFA To DFA

Conversion Of E-NFA To DFA

Conversion Of E-NFA To DFA

Let M=(Q,Σ,δ,q0,F) Be The NFA

M1=(Q1,Σ,δ1,q01,F1) Be The Equivalent DFA

1) Initial State:-

q0– ε-Closure(q0)

2) Construction Of δ1

δ1(q,x)=ε-Closure(δ(q,x))

Start The Construction Of δWith Initial State And Continue For Every New State.

3) Final State:-

Every Subset Which Contain The Final State Of ε-NFA Is Final State Of DFA

Example:-

1)  Initial State:-

q01=ε-Closure(q0)

={q0,q1}

q0=q0,q1

2)

18 thoughts on “Conversion Of E-NFA To DFA”

1. Do you have a spam problem on this blog; I also am a blogger, and I was wanting
to know your situation; we have developed some nice
practices and we are looking to trade strategies with other folks, why not shoot me an email if interested.

2. This design is incredible! You certainly know how to keep a reader
entertained. Between your wit and your videos, I was almost moved to
start my own blog (well, almost…HaHa!) Wonderful job.
I really enjoyed what you had to say, and more than that, how you presented it.
Too cool!

3. Wow! Finally I got a blog from where I be capable of truly take valuable
facts regarding my study and knowledge.

4. Thanks for some other informative web site. The place else may I am getting that kind of info written in such a perfect way? I’ve a venture that I am just now working on, and I’ve been at the glance out for such info.

5. I’m not sure exactly why but this blog is loading incredibly slow for me.
Is anyone else having this issue or is it a problem on my end?
I’ll check back later and see if the problem still exists.