A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.

Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!

正则表达式转NFA，DFA，最小DFA

北京邮电大学 2023-2024 春季学期《形式语言与自动机》课程实验——NFA 到 DFA 的转化

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.

Principles of Compiler Design Programs

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

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

Regular expression to finite state automaton conversion

A simple free-form interpreted language for building Turing machines and other automata

NFA to DFA Convertor written with JS

NFA and DFA simulator by Booker Martin

Small program that generates a transition function from nondeterministic finite automation to deterministic finite automation

Finite automata (DFA and NFA) with functionality to convert NFAs to DFAs and check string acceptance.

This tool dynamically converts a defined NFA (Nondeterministic Finite Automaton) to a DFA (Deterministic Finite Automaton), generates the transition table, and visualizes the graph.

Implementación de análisis léxico usando automatas

This is final project of Theory-of-Machines-and-Languages

Finite Automata

Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!

Theory of languages and automata projects in forth semester of university