The study of formal languages concerns the definition, description (generation) and parsing (recognition) of sets of strings over finite sets of symbols. The set of all binary representations of integers, the set of all palindromes over the lowercase Latin alphabet, and the set of all binary representations of Turing machines which do not accept themselves are examples of formal languages.