Finite Automata
Print this page
First   |   Last   |   Prev   |   Next
Transition table :

It is basically a tabular representation of the transition function that takes two arguments (a state and a symbol) and returns a value (the “next state”).

  • Rows correspond to states,
  • Columns correspond to input symbols,
  • Entries correspond to next states
  • The start state is marked with an arrow
  • The accept states are marked with a star (*).

 

 
0
1
First   |   Last   |   Prev   |   Next