A formal language is a set of strings that are formed from an alphabet such that the elements conform to a grammar or set of formation rules (also known as syntax). Elements of the formal language are called well-formed formulas. Formal languages may have a Deductive system put on top of them to to create a formal system.
Let be an alphabet.
Then a formal language is a subset of , where is the kleene star operator.