dfa

An implementation of regular expressions for Python that uses a finite state automaton（正则引擎的Python实现，包括从NFA到DFA和DFA的最小化）

From LTLf / PPLTL to Deterministic Finite-state Automata (DFA)

A Python library for simulating and visualizing finite automata

Some toy labs for compiler course

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.

AI-powered Mechanical Engineering Review Skill for CAD, FEA, DFM, DFA and Assembly Analysis.

A Python implementation to convert a Deterministic Finite Automata to Regular Expression using state elimination method

A simple python implementation of a DFA.

根据正则表达式生成其对应 DFA 的状态转移图

A list of useful python decorators

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.

Extracting minimal DFA's from well-trained RNN's

A Tool for Drawing the DFA/NFA of a Regex for a Regular Language

Theory of machines and languages course project.

Experiments with Direct Feedback Alignment and comparison to Backpropagation.

Python library for identifying/learning DFAs from labeled examples by reduction to SAT.

Implementation of finite-state machines and exportation to dot format

LR(0)/SLR(1)/LR(1)/LALR(1), syntax analysis, simple calculator