Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)
-
Updated
Jun 19, 2023 - Python
Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)
A simple script to convert Python regular expression to expressions following the formal defintion
Lambda-NFA to DFA real-time visualizer
Kumpulan Projek Selama Mengikuti Matakuliah Teori Bahasa dan Otomata
A CLI program that converts an input Non-Deterministic Finite Automaton into a Deterministic Finite Automaton.
This is final project of Theory-of-Machines-and-Languages
My codes for assignments for Automata Theory Course Spring 2021
Codes to convert Regex-to-NFA, NFA-to-DFA, DFA -to-Regex, minimizing DFA.
All CC-Labs of Sir Nadeem.
Experimental implementation of regex & construct NFA/DFA from regex (graphviz)
giva nfa,translat nfa to dfa , minimize dfa , you will get your dfa information
A CLI program that converts εNFA to NFA and NFA to DFA.
Theories of Machines and Languages Project - Spring 2022
Boyer-Moore string-search algorithm, NFA to DFA Conversion
Conversions between NFA, DFA, regex and DFA minimization, Automata Theory | Spring 2021
Theory of languages and automata projects in forth semester of university
Theory of Machines and Languages Project
Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular
Add a description, image, and links to the nfa-to-dfa-conversion topic page so that developers can more easily learn about it.
To associate your repository with the nfa-to-dfa-conversion topic, visit your repo's landing page and select "manage topics."