A Python package for automata theory.

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

A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)

AUT Formal Languages and Automata course programming assignment

Pure-Python library for building and working with nondeterministic finite automata (NFAs).

Regex -> ε-NFA -> DFA -> minDFA, lexical analysis

Midterm project of Theory of languages and automata - Mentorship

Theory of Machines and Languages Project

🔃 Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator 🔀

Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)

Conversion from Non-Deterministic Finite automata (NFA) to Deterministic Finite automata (DFA)

Automata Theory Project

Theory of languages and automata projects in forth semester of university