## FANDOM

175 Pages

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.

## Formal definitionEdit

Let $\Sigma$ be an alphabet.

Then a formal language $\mathcal{L}$ is a subset of $\Sigma^*$, where $*$ is the kleene star operator.