Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!
-
Updated
Apr 3, 2024 - CSS
Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!
A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.
正则表达式转NFA,DFA,最小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).
Regular expression to finite state automaton conversion
Finite Automata
A simple interpreted language for building Turing machines and other automata
Small program that generates a transition function from nondeterministic finite automation to deterministic finite automation
Conversion from Non-Deterministic Finite automata (NFA) to Deterministic Finite automata (DFA)
NFA and DFA simulator by Booker Martin
NFA to DFA Convertor written with JS
This is final project of Theory-of-Machines-and-Languages
Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!
Theory of languages and automata projects in forth semester of university
Add a description, image, and links to the nfa-to-dfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa-to-dfa topic, visit your repo's landing page and select "manage topics."