Convert DFAs into regular expressions using the transitive closure method in Python 3.
The programm works best with automatons that have only one initial state and only one final state.
git clone https://github.com/anedomansky/dfa-to-reg-exp.git
Remove definitions from the ./automaton-definitions
OR
Add new .xml automaton definition files from AtoCC to the ./automaton-definitions
cd dfa-to-reg-exp
example script call:
python main.py ./automaton-definitions/automaton_two_states_one_final_book_example.xml
- Python 3 interpreter
- git
- AtoCC for creating and exporting the automaton definitions
- execute the 'Starte AutoEdit.exe'
- New
- Next
- Add alphabet items
- Add states (use the default naming e.g. 'q_0') !!!
- Design the transition graph
- File -> Export -> Automaton Definition XML
- Place the created file in `./automaton-definitions/name_of_definition_file.xml