Definition 1.3.1: the reversal of _1_2 … _k_ _* is
(_1_2 … _k)R = _k_k-1 … _1. The reversal of L _ _* is
LR = {xR | x _ L}.
Theorem 1.3.4: for each regular language L _ _*,
LR is also regular.
Corollary 1.3.3: the regular languages are closed under complementation and intersection.
| Previous slide | Next slide | Back to first slide | View graphic version |