This course is about the handling of state machines: read a finite state machine (in ASCII), make an internal representation, determine if strings belong to its language, determine if it is deterministic and/or finite, convert it into a non-deterministic automaton, read regular expression and read push down automaton.