Definition 1.2.3: A deterministic finite acceptor (DFA) A is a 5-tuple A = (S, _, _, s0, R), where (S, _, _) is a deterministic transition system, s0__S is the start state, and R _ S is the set of recognizing (or accepting) states.
The language recognized (or accepted) by A is L(A) = {x_ _* | _(s0, x) __R}. A language L____* is DFA-recognizable if there exists a DFA A so that L = L(A).
Previous slide | Next slide | Back to first slide | View graphic version |