Definition:Word (Formal Systems)

Definition
Let $\mathcal F$ be a formal language.

Let $\mathcal A$ be the alphabet of $\mathcal F$.

Then a word in $\mathcal A$ is defined as a finite string of symbols of $\mathcal A$.

Also known as
Different treatments of formal languages use different terms for word.

Examples include formula, sentence and string.

However, these alternatives conflict with the concepts logical formula, sentence and string, respectively, in the scope of this site; therefore, their use is discouraged.

Also see

 * Well-Formed Word, a word in $\mathcal A$ approved of by the formal grammar of $\mathcal F$