Automata Theory
This is a small library to easily create and manipulate Finite State Machine / Automata.
Python 3.9 or higher is required.
A new version without typing informations may be pushed later to run on lower versions.
- Draw a finite state machine into a .dot file. (Note that a dot file can be converted to a .png file using
dot -Tpng <filename>.dot -o <outputname>.png) - Check if a word can be admited by the automata
- Check if an automata is deterministic, complete, accessible or co-accessible
- Convert an automata to a deterministic or complete or accessible or co-accessible equivalent
- Create an automata that accept the complementary, union or intersection of the current accepted language
- Support regular expressions