Library for determinization, complementation and containment checking for Buchi automata
-
Updated
Oct 23, 2026 - C++
Library for determinization, complementation and containment checking for Buchi automata
Python implementation of Finite State Automata (FSA) covering word recognition, completion, NFA-to-DFA determinization, DFA minimization, and regex conversion. Includes a Tkinter GUI for interactive automaton manipulation and a full test suite.
Implémentation des algorithmes de la théorie des automates finis en Python — BUT1 Informatique
Python simulator for DFA, NFA, PDA, and CFG featuring batch testing, DFA minimization, NFA determinization, and Graphviz visualization.
To associate your repository with the determinization topic, visit your repo's landing page and select "manage topics."