A Python package for automata theory.

Graphical interface for designing finite automata

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

Lab Experiments for the Compiler Design Lab

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

State Machine App is a web app for automata enthusiasts, offering seamless conversion of Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) alongside advanced algorithms for DFA minimization and reduction. With its intuitive interface, powerful features,and simplify complex automata tasks, making it a better application.

Theory of Computation | Conversion from NFA to DFA

Converts a given NFA to DFA

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

Midterm project of Theory of languages and automata - Mentorship

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

Regexp to NFA to DFA

Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)

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

NFA to DFA Convertor written with JS

converting NFA to DFA with graphical interface

Implementation of a Non-deterministic Finite Automaton in C++. The program can show the dead states, check if the NFA is a DFA and analyze a string to see if it belongs to the NFA.

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 🔀