jFAST

jFAST is a simple, easy-to-use tool for creating, editing, and simulating finite automata and state machines. It provides a simple and intuitive method of interacting with numerous types of supported finite state machines (FSM), including deterministic finite automata (DFA), non-deterministic finite automata (NFA), pushdown automata (PDA), state machines (SM), and Turing machines (TM). jFAST also provides user`s with the ability to check their FSM on different inputs, and provides clear and meaningful messages when mistakes are encountered.