A set of strings (finite or infinite) over some alphabet. In the context of theory of computation, typically restricted to finite strings. CSE 103
Context
In formal language theory, languages are the central object of study. For example, the set of all binary strings with equal numbers of 0s and 1s is a language. Languages are classified by the type of automaton or grammar needed to recognize or generate them (regular, context-free, etc.).