Alphabet

Summary

In formal language theory, an alphabet is a finite nonempty set whose elements are called symbols or letters. Strings are finite sequences of symbols from an alphabet, and formal languages are sets of strings. The usual alphabets are $\set{0, 1}$ for binary data and $\set{a, b}$ for examples. The symbols have no meaning of their own; only their identity matters.