A formal language L over an alphabet Σ is a subset of Σ*, that is, a set of words over that alphabet.
In computer science and mathematics, which do not usually deal with natural languages, the adjective "formal" is often omitted as redundant.
While formal language theory usually concerns itself with formal languages that are described by some syntactical rules, the actual definition of the concept "formal language" is only as above: a (possibly infinite) set of finite-length strings, no more nor less. In practice, there are many languages that can be described by rules, such as regular languages or context-free languages. The notion of a formal grammar may be closer to the intuitive concept of a "language," one described by syntactic rules. By an abuse of the definition, a particular formal language is often thought of as being equipped with a formal grammar that describes it.
Read more about Formal Language: Examples, Language-specification Formalisms, Operations On Languages
Famous quotes containing the words formal and/or language:
“The formal Washington dinner party has all the spontaneity of a Japanese imperial funeral.”
—Simon Hoggart (b. 1946)
“My God! The English language is a form of communication! Conversation isn’t just crossfire where you shoot and get shot at! Where you’ve got to duck for your life and aim to kill! Words aren’t only bombs and bullets—no, they’re little gifts, containing meanings!”
—Philip Roth (b. 1933)