Next: Transition on Strings
Up: Finite Automaton
Previous: Minimization of an FA
An FA is a 5-tuple 
, where
- Q:
- finite set of states
-
:
- finite input alphabet
-
:
- transition function
-
- start state
- F:
- set of final states
Note: An FA conceptually has a read head which moves right only.
Sushil Prasad
Tue Jul 7 12:26:32 EDT 1998