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.
converting NFA to DFA with graphical interface
🔧 A Finite Automata Machine Tool.
Conversions between NFA, DFA, regex and DFA minimization, Automata Theory | Spring 2021
eNFA - NFA, DFA - DFA minimization, CNF and CKY
Theory of languages and automata projects in forth semester of university
Introduction to automata theory, languages and computation
DFAjudge - Sistema de auxílio na aprendizagem da disciplina de Linguagens Formais e Autômatos
Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.
Transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states
A program that takes a dfa as input and output its minimum equivalence states partitions.
A simple DFA minimization project implemented with tkinter python library, and a Cpp backend.
a compiler that converts regular expressions to images of DFA
Relatório Final da minha Iniciação Cientifica: DFAjudge - Sistema de auxílio na aprendizagem da disciplina de Linguagens Formais e Autômatos
Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
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
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."