UKZN Computer Science Theory of Computation 3rd year project.
-
Updated
Jan 15, 2016 - Java
UKZN Computer Science Theory of Computation 3rd year project.
A program in Java and QT Jambi to convert an NFA to a DFA and minimize it
Assignments for the course CSD303 Theory Of Computation
Java implementation of a Definite & Indefinite finite automata
Java program that converts regular expression to DFA.
Theory of Computation | Conversion from NFA to DFA
Translate regular expression to NFA map picture(正规式构造NFA图片)
automata machines implemented in Core JAVA.
A little toolbox that provides detector and converter for DFA machines
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."