This is a Python 3 script made to minimize a Deterministic Finite Automaton (DFA) using Hopcroft's Algorithm. This was made as an assignment for my university.
Pre-compiled binary packages won't be available. If you want to try the pre-release version of the app, you should compile it yourself by following the instructions below.
- Graphviz
- Python 3.5+
- Pip
Install the direct dependencies with apt:
$ apt install graphvizUse brew to install the dependencies:
$ brew install graphviz$ git clone https://github.com/luigifreitas/dfa-minimizer
$ cd dfa-minimizer
$ pip3 install -r requirements.txt
You can find examples of DFA on both example.py files.
$ python3 example1.py
$ python3 example2.pydfa.add_state(1) # Adds a new state.
dfa.add_start_state(0) # Add the initial state.
dfa.add_final_state(1) # Add the final state.
dfa.add_symbol('a') # Add a symbol in the alphabet.
dfa.add_transition(1, 'a', 3) # Declare a transition.dfa.minimize()dfa.print() # Prints a summary about the DFA.
dfa.draw("dfa_after") # Draw the current DFA.This module is distributed under a GPL-3.0 License.