Automata Conversions algorithms in Java.
Automata Conversions algorithms in Java
Conversions also can obtain convert to DFA Minimalistic form.
Non-deterministic finite automata(NFA) is a finite automata where
for some cases when a specific input is given to the current state,
the machine goes to multiple states or more than 1 states. It can contain ε move(epsilon-NFA).
On the other hand, in DFA, when a
specific input is given to the current state, the machine
goes to only one state. DFA has only one move on a given input symbol.
git clone https://github.com/islajd/Automata-Conversion.git
In our case git has cloned the project in home directory.
Create directory ‘out’ inside Automata-Conversion.
mkdir out
To compile project run the following inside the directory ‘Automata-Conversion’:
javac -sourcepath src -d out src/AutomataConversionApplication.java
To run the project use the commands below:
java AutomataConversionApplication
Input templates are included in project path. (i.e. Input)