Automata Conversions algorithms in Java.
-
Updated
Mar 20, 2020 - Java
Automata Conversions algorithms in Java.
A powerful toolkit for converting Regular Expressions to DFA and Context-Free Grammars. Built for students, educators, and enthusiasts of Theory of Automata.
An assignment where i needed to convert a non-deterministic finite automaton with epsilon transitions into a deterministic finite automaton.
Add a description, image, and links to the automata-conversion topic page so that developers can more easily learn about it.
To associate your repository with the automata-conversion topic, visit your repo's landing page and select "manage topics."