Next:
Up:
Previous:
Finite Automata
A finite automata M = (Q,
q
_{0}
, A,
,
), where
Q = set of states (
s
_{i}
)
q
_{0}
= start state (
s
_{0}
)
A = set of accepting states
= input alphabet
= transition function Qx
Q
Next:
Up:
Previous: