String
Builds on AlphabetFree monoid
Definition
Let be an alphabet. A string, or word, over is a finite sequence with and each . Its length is . The string with is the empty string, written . The set of all strings over is written . The concatenation of and is .
Remarks
Example: over , is a string of length , and its concatenation with is . Non-example: the infinite sequence is not a string, since a string has finite length; such sequences are infinite words, studied separately. Concatenation is associative, , and . So with concatenation is the free monoid on . For , denotes the set of strings of length , and the set of nonempty strings.
Reading path
To understand this page from the ground up, read these 23 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Monoid concept
- 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
- Free monoid definition
- Surjective function definition
- Bijective function definition
- Equinumerous sets definition
- Finite set definition
- Alphabet definition
- String definition
Where this leads
9 pages build on this one.
Further reading
About this page
| Tag | D9FCP61J44 |
|---|---|
| URI | m2://D9FCP61J44 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 68Q45, 68R15 |
| Defines | String |
| Uses | Alphabet, Free monoid |
| 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.