An Automata Learning Library Written in Python
-
Updated
Feb 9, 2026 - Python
An Automata Learning Library Written in Python
An implementation of regular expressions for Python that uses a finite state automaton(正则引擎的Python实现,包括从NFA到DFA和DFA的最小化)
A Python library for simulating and visualizing finite automata
A Python package for automata theory.
Visual Automata is a Python 3 library built as a wrapper for the Automata library to add more visualization features.
A Python implementation to convert a Deterministic Finite Automata to Regular Expression using state elimination method
根据正则表达式生成其对应 DFA 的状态转移图
This repository contains various programs related to the theory of computation
A tiny library which contains tools to convert, minimize and visualize Regular Expressions, NFA and DFA.
Theory of machines and languages course project.
A Tool for Drawing the DFA/NFA of a Regex for a Regular Language
Implementation of finite-state machines and exportation to dot format
Experiments with Direct Feedback Alignment and comparison to Backpropagation.
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."