Finite Automata
1
, Finite Automaton
Input
String
Output
Finite String
Automaton
2
, Finite Accepter
Input
String
Output
“Accept”
Finite
or
Automaton
“Reject”
3
, Transition Graph
abba -Finite Accepter a, b
q5
a a, b
b a b
q0 a q1 b q2 b q3 a q4
initial final
state state
transition
state “accept”
4