This project Finite Automata Optimizer (Otimizador de Autômatos Finitos) was developed to reduce any NFA (Nondeterministic Finite Automata) to a minimal DFA (Deterministic Finite Automata).
This is a flowchart showing the operation of the application:
For the sample input below:
|a b c
q0 q1 q2 q3
q0 _ q1
q0 a q3
q0 b q2
q1 c q2
q1 c q3
q0 a q2q3q3
q0 c q2q3q3
Here are some screenshots of the automata been optimized:
This source was written in Java language using NetBeans 7.x as IDE and the JUNG library to draw the graphs.
All classes, methods, atributtes, etc. are written in English, but most comments are written in Brazilian Portuguese (as required by the teacher).
This code was co-authored in collaboration with my classmate Guilherme Maganha Moreira.
We can not guarantee that the algorithms are 100% correct, because at the time we wrote this code we are still learning about automata.
Source code is available at GitHub
If you find this useful or have any questions, we will be happy to help you.