A Python package for automata theory.

• UpdatedJan 17, 2024
• Python

Graphical interface for designing finite automata

• UpdatedOct 11, 2020
• JavaScript

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

• UpdatedNov 20, 2018
• Python

Lab Experiments for the Compiler Design Lab

• UpdatedNov 27, 2018
• C

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)

• UpdatedAug 3, 2020
• Python

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.

• UpdatedMay 4, 2024
• CSS

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

• UpdatedAug 4, 2022
• Python

Midterm project of Theory of languages and automata - Mentorship

• UpdatedMay 13, 2023
• Python

Theory of Computation | Conversion from NFA to DFA

• UpdatedJul 14, 2019
• Java

AUT Formal Languages and Automata course programming assignment

• UpdatedAug 2, 2020
• Python

NFA to DFA Convertor written with JS

• UpdatedJan 11, 2024
• JavaScript

Converts a given NFA to DFA

• UpdatedAug 29, 2018
• Java

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

• UpdatedFeb 2, 2018
• Java

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

• UpdatedFeb 11, 2023
• Python

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

• UpdatedJun 8, 2021
• Python

Regexp to NFA to DFA

• UpdatedDec 12, 2022
• JavaScript

converting NFA to DFA with graphical interface

• UpdatedAug 27, 2019
• JavaScript

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.

• UpdatedDec 31, 2017
• C++

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

• UpdatedJan 13, 2019
• Python

FlyWeight Finite Automata Simulator

• UpdatedFeb 24, 2025
• C#