Construct a minimal DFA from a regular expression using Thompson, determinisation, and minimisation algorithms.
To compile the project run the following command in the root directory of the project.
make
To start the DFA builder, run the following command.
./regexdesc
This DFA builder was optimised by using char type to store a maximum of 8 state in a bitwise manner (as using array of int would have taken much more space to store boolean data).
Distributed under the GNU GENERAL PUBLIC license. See LICENSE
for more information.