An automata simulator, converts a regular expression to a Finite Deterministic Automata.
-
Updated
Sep 6, 2018 - Java
An automata simulator, converts a regular expression to a Finite Deterministic Automata.
Assignments for the course CSD303 Theory Of Computation
Add a description, image, and links to the thomson-nfa topic page so that developers can more easily learn about it.
To associate your repository with the thomson-nfa topic, visit your repo's landing page and select "manage topics."