We help IT Professionals succeed at work.
Get Started

Converting an NFA to a DFA?

Last Modified: 2013-11-18

I'm trying to figure out how to convert an NFA to a DFA. (I assume people in this topic know what those are, if not let me know I will try to explain).

Making an NFA from a regular expression is ok, I just don't get the process by which you build a DFA from it. I think that you can visit each state of an NFA with every letter in your input alphabet, and tally up all the states you could be in - could someone let me know how to do this, step by step?

Watch Question
Top Expert 2009
This problem has been solved!
Unlock 1 Answer and 3 Comments.
See Answer
Why Experts Exchange?

Experts Exchange always has the answer, or at the least points me in the correct direction! It is like having another employee that is extremely experienced.

Jim Murphy
Programmer at Smart IT Solutions

When asked, what has been your best career decision?

Deciding to stick with EE.

Mohamed Asif
Technical Department Head

Being involved with EE helped me to grow personally and professionally.

Carl Webster
CTP, Sr Infrastructure Consultant
Ask ANY Question

Connect with Certified Experts to gain insight and support on specific technology challenges including:

  • Troubleshooting
  • Research
  • Professional Opinions
Did You Know?

We've partnered with two important charities to provide clean water and computer science education to those who need it most. READ MORE