Aditya Shankar Tripathi kipawa
kipawa
/ gist:10fec56cab1f8d0c33a9
Created
January 21, 2015 16:29
A simple and basic program in C to convert NFA to DFA (does not handle null moves)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* A program to convert NFA to DFA using conversion table | |
| Author - Kipawa | |
| Technique used - Bitmasking | |
| NOTE - | |
| 1. If your states are q0, q1, q2 they will be represented as follows (in the table) | |
| q0 = 2^0 = 1 | |
| q1 = 2^1 = 2 | |
| q2 = 2^2 = 4 |