Draw DFA

An application for generating and performing operations on deterministic and nondeterministic finite automata.

🎥 Watch the project video
🚀 Try the project

Table of Contents

1. About The Project
2. Getting Started
   • Running The Program
3. Roadmap
4. Usage
5. Contributors
6. Connect
7. License
8. Acknowledgments

About The Project

This program was completed as a final project among three students for CS454 (Theory of Computation) at Sonoma State University in fall 2024.

Automata theory plays a very important role in computer science, yet many of its concepts can be abstract and difficult to visualize. To resolve this, we developed a tool inspired by JFLAP, which was implemented using JavaScript and React.. The tool allows users to interactively create and analyze Deterministic and Non-Deterministic Finite Automata (DFA and NFA). It also provides features that allow users to test string membership and evaluate DFA equivalence by using the cross-product algorithm. By combining clear visualization and user-friendliness, our project simplifies automata-related problems and makes theoretical concepts related to such machines more accessible.

Getting Started

Running The Program

1. Clone the repo

git clone https://github.com/officialblake/Draw-DFA.git

2. Install dependencies via

 npm i

3. Start the application via

 npm start

Roadmap

See the open issues for a full list of proposed features (and known issues).

Contributors

Three students worked together to implement this project.

Connect With Us

Blake Marshall - LinkedIn
Homero Arellano - LinkedIn
Jacob Sellers - LinkedIn

License

Distributed under the MIT License. See LICENSE.txt for more information.

(back to top)