NFA and DFA simulator by Booker Martin
-
Updated
Mar 22, 2021 - TypeScript
NFA and DFA simulator by Booker Martin
Python solutions for Introduction to Theoretical Computer Science laboratory exercises.
Conversions between NFA, DFA, regex and DFA minimization, Automata Theory | Spring 2021
Theory of languages and automata projects in forth semester of university
DFAjudge - Sistema de auxílio na aprendizagem da disciplina de Linguagens Formais e Autômatos
A simple DFA minimization project implemented with tkinter python library, and a Cpp backend.
Relatório Final da minha Iniciação Cientifica: DFAjudge - Sistema de auxílio na aprendizagem da disciplina de Linguagens Formais e Autômatos
Kumpulan Projek Selama Mengikuti Matakuliah Teori Bahasa dan Otomata
Implementation of a dictionary based on minimal deterministic finite-state automata
Aim is to convert a given DFA to its minimized state
DFA Minimization using Table Filling Method
DFA Minimization
Automata implementations
An algorithm to convert a DFA to its minimal form
Useful tools for people interested in mathematics and computer science (with a focus on the latter)
🖨️ Formal Languages and Compiler Design Uni Laboratory tasks
Determinization and minimization of NFA
Add a description, image, and links to the dfa-minimization topic page so that developers can more easily learn about it.
To associate your repository with the dfa-minimization topic, visit your repo's landing page and select "manage topics."