One of the subjects in our curriculum is the Automata and Language Theory which implies on Computer Science topics. One of the topics that this subject had is the Regular Expression, Deterministic Finite Automata and Nondeterministic Finite Automata that shows how the process of the finite state machine works. During the discussion of this topic, most of the instructors taught this topic manually, and they deliver it hard to visualize the process towards the students. The team came up with an idea of making this project for the tools of the instructor and for students who are taking Automata make easier. The objective of the project is to visualize the process of the finite state machine. The major functionalities of the project are to create and simulate the finite state machine. In this project also includes the parser which will guide the user in creating the user in creating the machine and test if the machine will accept the strings that the user will input. By implementing this program, the topic will be more understandable to the students. Therefore, this will be great help for the instructors and the students.