Regular Languages: Closure and Decisions
Closure of the regular languages under union, intersection, complement, difference, concatenation, star, reversal, homomorphism, inverse homomorphism and quotient, with the construction behind each; the decision procedures for membership, emptiness, finiteness, universality, equivalence and containment with their bounds; Myhill-Nerode as a characterisation; closure arguments that prove a language non-regular; and the one-way nature of closure (subsets, unions of non-regular languages, infinite unions). Decision bounds were tested on random DFAs.
