mad 3512 - theory of algorithms - FIU
... grammars, & regular expressions; closure properties, homomorphisms,
decidability properties, regular and non-regular languages, the pumping lemma
for regular languages, counter-examples involving non-regular languages,
Turing machines, configuration, computation, deterministic TMs, Turing-
computable functions, ...