• Author: Jake Lammers, Munib Ahmed
• Class: CS361 Section # 001
• Semester: Fall 2023

This project involves building and managing nondeterministic finite automata (NFAs) using Java, focusing on a detailed representation of their behaviors, states, and transitions. It offers a structured method for simulating and analyzing NFAs within a defined framework.

During the NFA project, we built essential classes like 'NFA' and 'NFAState' to simulate a Non-deterministic Finite Automaton. We focused on accurately implementing complex epsilon transitions, particularly within the 'eClosure' method. Through teamwork, we overcame challenges in creating methods like 'addTransition' and 'isDFA', ensuring our automaton correctly recognized various language patterns. This experience improved our problem-solving skills and emphasized the importance of thorough testing in software development.

Navigate to the top of the directory that holds the project:

To compile Junit and NFATest on Onyx use the following command:

javac -cp .:/usr/share/java/junit.jar ./test/nfa/NFATest.java

To run the tests to check functionality use this command on a single line:

java -cp .:/usr/share/java/junit.jar:/usr/share/java/hamcrest/core.jar org.junit.runner.JUnitCore test.nfa.NFATest

N/A