Alphabet
Builds on Finite set
Definition
An alphabet is a nonempty finite set . Its elements are called symbols or letters.
Remarks
Example: is an alphabet, since it is finite and nonempty. Non-example: the set of natural numbers is not an alphabet in this sense, since it is infinite. Some authors allow infinite alphabets in combinatorics on words, and some allow the empty alphabet; most of automata theory uses the finite nonempty case. The letter is the usual name for an alphabet, and is the set of strings over it.
Reading path
To understand this page from the ground up, read these 20 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Codomain definition
- Injective function definition
- Surjective function definition
- Bijective function definition
- Equinumerous sets definition
- Finite set definition
- Alphabet definition
Where this leads
10 pages build on this one.
Further reading
About this page
| Tag | SEVFW9PNMC |
|---|---|
| URI | m2://SEVFW9PNMC |
| Kind | definition |
| Writing | W0 stub |
| MSC | 68Q45, 68R15 |
| Defines | Alphabet |
| Uses | Finite set |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.