A tour in the wonderland of math with python.
-
Updated
Feb 3, 2026 - Python
A tour in the wonderland of math with python.
A Thompson's Algorithm based RegEx to NFA compiler, implemented in Julia.
Deterministic Finite Automata: This program analyzes a string of 0's and 1's, manually or automatically, and tells you if the string have the same number of 0's than 1's. Also. It works with an automata
DFAjudge - Sistema de auxílio na aprendizagem da disciplina de Linguagens Formais e Autômatos
Python implementation of finite automata algorithms — NFA→DFA subset construction, Hopcroft minimization, complementation, union, concatenation, and word recognition.
To associate your repository with the hopcroft topic, visit your repo's landing page and select "manage topics."