Theorem 1.2.1: the complement of each DFA-recognizable language is DFA-recognizable.
The DFA model admits an obvious table driven algorithm to automate testing membership of candidate strings — for w _ _* , is w _ L(A)?
| Previous slide | Next slide | Back to first slide | View graphic version |