Formal Language
A language model defined as a set of finite strings over an alphabet, with membership studied through mathematical rules and machine models.
A formal language is a selected set of finite strings over an alphabet. The important question is not whether a string looks meaningful to a person, but whether it satisfies a mathematically defined membership rule.
Languages can be described through regular expressions, grammars, or machine models that recognize them. Increasing the available machine memory changes the class of languages that can be recognized.
A Finite Automaton recognizes regular languages, while a Right-Linear Grammar describes the same class through production rules. The full progression is developed in Automata Theory and Formal Languages.