Finite Automata is not a game, it is intended to be used in a Computer Science course to help teach students how to design algorithms using finite automata.
The ideal setup is having the students design their automata by hand on a notebook and then transfer to the application to be able to test the automata.
Available commands:
states n
- creates n states from 0 to n-1
- state 0 is the initial state, always
add n
- adds a state n
final n
- toggles State n as a Final State
- multiple states may be Final
st1 event st2
- transition from st1 to st2 for event
- st1 and st2 are integer numbers
- event is a String, no " necessary
clear
- remove all states and transitions
del state1
- deletes a state and all related
transitions
del state1 event state2
- deletes the transition
help
- shows this help information
show
- shows the automaton
========= Example ==========
> states 3
> final 2
> 0 a 1
> 0 b 0
> 1 a 2
> 1 b 0
> 2 a 2
> 2 b 2
This automaton accepts inputs on
{a, b}* that contains "aa" as part of
the sequence.
==========================