Example

Here is a finite automaton accepting strings with an even number of ``a''s. $\Sigma$ = {a, b, c}.

$\delta$(s₀, a) = s₁
$\delta$(s₀, b) = $\delta$(s₀, c) = s₀
$\delta$(s₁, a) = s₂
$\delta$(s₁, b) = $\delta$(s₁, c) = s₁
$\delta$(s₂, a) = s₁
$\delta$(s₂, b) = $\delta$(s₂, c) = s₂

Consider input string w. If w ends at state , then the FA accepts w; otherwise, the FA rejects w.

Example: str = bccabaccaba

Accept