Given an alphabet A, with free monoid A*, a formal language L with alphabet A is a subset of A*.
Each kind of language corresponds to a certain kind of automaton
Corresponds to finite automata