determinization

Lexers for real languages, built at runtime. C++23 combinators to a minimized DFA, with certified-safe parallel scanning.

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.

Library for determinization, complementation and containment checking for Buchi automata

Implémentation des algorithmes de la théorie des automates finis en Python — BUT1 Informatique