Library for determinization, complementation and containment checking for Buchi automata
-
Updated
Mar 4, 2025 - 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.
Add a description, image, and links to the determinization topic page so that developers can more easily learn about it.
To associate your repository with the determinization topic, visit your repo's landing page and select "manage topics."