Expiring Today—Celebrate National IT Professionals Day with 3 months of free Premium Membership. Use Code ITDAY17

x
Solved

# Converting an NFA to a DFA?

Posted on 2009-05-06
Medium Priority
1,012 Views
Hi,

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?

Thanks
0
Question by:DJ_AM_Juicebox
[X]
###### Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

• Help others & share knowledge
• Earn cash & points
• 2

LVL 53

Accepted Solution

Infinity08 earned 2000 total points
ID: 24323552
The idea is to group several NFA states into one DFA state, check the possible next NFA states, group them together into new DFA states, and repeat until all DFA states have been completed.

You start with the initial state(s) of the NFA, and add one state to the DFA that corresponds to that set of states.
For each next symbol of those states (in the NFA), you add an outgoing arrow to the DFA state, and determine the target states for each of them (each of these new DFA states will again correspond to a collection of NFA states).
Repeat this for each of the DFA states identified.

For example, if you have this NFA :

_0
/ \
| \/
-----  1    -----  0    ------
---->| A |---->| B |---->|*C*|
-----        -----        ------
| /\
\_/
1

(I hope that's clear, but A is the initial state, with 0 and 1 looping back to it, and 1 going to B. From B, 0 is going to C, which is the end state (marked by *'s).

To construct the DFA, you start with the initial state (A) in the NFA, and create a state for it in the DFA : {A} :

---------
---->| {A} |
---------

In the NFA, the state A allows two next symbols (0 and 1), so in the DFA, we add two outgoing arrows (one for symbol 0, and one for symbol 1). In case of symbol 0, the next state is always A, so in the DFA, that becomes a loopback. In case of symbol 1, the next state is either A or B, so in the DFA, we add a new state {A,B} :

_0
/ \
| \/
---------  1   -----------
---->| {A} |---->| {A,B} |
---------       -----------

State {A} in the DFA is now complete, so we move to state {A,B}. From the states A and B in the NFA, we again recognize two next symbols 0 and 1. In case of symbol 1, the next state is always A, so in the DFA, we add a pointer back to state {A}. In case of symbol 0, the next state is either A or C, so in the DFA, we add a new state {A,C} :

_0
/ \
| \/
---------  1   -----------  0   -----------
---->| {A} |---->| {A,B} |---->| {A,C} |
---------       -----------       -----------
/\              |
\_______/
1

State {A,B} in the DFA is now complete, so we move to state {A,C}. From the states A and C in the NFA, we again recognize two next symbols 0 and 1. In case of symbol 0, the next state is always A, so in the DFA, that becomes a pointer to state {A}. In case of symbol 1, the next state is either A or B, so in the DFA, that becomes a pointer to state {A,B} :

_0     ________________0
/ \     /                                \
| \/  \/                                 |
---------  1   -----------  0   -----------
---->| {A} |---->| {A,B} |---->| {A,C} |
---------       -----------       -----------
/\              |     /\              |
\_______/      \_______/
1                    1

State {A,C} in the DFA is now complete, and there are no more states to process. All we have to do now, is mark one or more states in the DFA as end states. In this case, there's only one : {A,C} :

_0     ________________0
/ \     /                                \
| \/  \/                                 |
---------  1   -----------  0   ------------
---->| {A} |---->| {A,B} |---->|*{A,C}*|
---------       -----------       ------------
/\              |     /\              |
\_______/      \_______/
1                    1

If the sketches in the post aren't clear, here they are again in a fixed width font :
``````NFA :

_0
/ \
| \/
-----  1  -----  0  -----
---->| A |---->| B |---->|*C*|
-----     -----     -----
| /\
\_/
1

DFA :

_0    ____________________0
/ \   /                    \
| \/ \/                    |
-------  1  ---------  0  ---------
---->| {A} |---->| {A,B} |---->| {A,C} |
-------     ---------     ---------
/\       |    /\       |
\_______/     \_______/
1             1
``````
0

Author Comment

ID: 24350903
Dang, thanks Infinity, works now,

Thanks
0

Author Closing Comment

ID: 31578851
bangarang!
0

## Featured Post

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Navigation is an important part of web design from a usability perspective. But it is often a pain when it comes to a developer’s perspective. By navigation, it often means menuing. This is less theory and more practical of how to get a specific gro…
How to remove superseded packages in windows w60 or w61 installation media (.wim) or online system to prevent unnecessary space. w60 means Windows Vista or Windows Server 2008. w61 means Windows 7 or Windows Server 2008 R2. There are various …
The goal of the video will be to teach the user the difference and consequence of passing data by value vs passing data by reference in C++. An example of passing data by value as well as an example of passing data by reference will be be given. Bot…
This video will show you how to get GIT to work in Eclipse.   It will walk you through how to install the EGit plugin in eclipse and how to checkout an existing repository.
###### Suggested Courses
Course of the Month11 days, 8 hours left to enroll