Java program designed to create NFA, DFA and context free grammars, allowing to perform lexical and syntactic analysis.
-
Updated
Oct 9, 2022 - Java
Java program designed to create NFA, DFA and context free grammars, allowing to perform lexical and syntactic analysis.
Transforms DFA to regex and regex to DFA and NFA. (Finite State Machines) Demonstrate is done using the Kleene theorem. In addition, a comparison is made between the string sizes of the regular expressions obtained from converting DFA with a reduction.
A very simple regex matcher written in Java.
Implementation of fully-functioned finite automata (DFA/NFA), also include schematically implementation
A simple Java program to run non-deterministic final state automata (NFAs).
A Theory of Computation mini project in progress using Java and JavaFX GUI.
automata machines implemented in Core JAVA.
Exploration of Formal Languages and the machines that go with them. Multiple examples of DFAs, NFAs, Stack Machines, and Turing Machines.
A program in Java and QT Jambi to convert an NFA to a DFA and minimize it
Samples of algorithms to verify strings / words using finite machines.
Implementation of a Finite Automata Simulator
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."