Automatas are widely used as introductory objects in Theory of Computation courses. They are best mastered with practice and experience. Students are often unclear on whether their Finite State Automatons are doing what they want them to do. This motivated us to create an extensible, independent, and user-friendly application that caters to a broad class of students, and is easy-to-use for the instructor.