Preference in practice: Determinictic FA (DFA) that makes no more than one move
from every configuration.
Definition: Let M = (Q, S, R, s, F) be a FA. M is an e-free finite automaton if for all
rules pa ® q Î R, where p, q Î Q, holds
a Î S (a ¹ e )
From FA to DFA in Essence 1/2
s
p
q
f
a
a
1) Gist: Removal of e-moves
e
e
4/44
a