Words over a Finite Alphabet: the Empty Word, Concatenation and Reversal
definitionCombinatoricsdef:words-finite-alphabet-2026bDefines the words in finitely many letters, including the empty word, together with concatenation and reversal.
Let be the set of natural numbers with its addition and order, let , and for let be the initial segment determined by and the set of -tuples in , that is, of maps .
1. (Words)¶ The empty word is the map with empty domain and values in . For , a word of length is an element of . The set of words in the letters consists of the empty word and of the words of length for all . A word of length has domain , which is nonempty by claim 1 of Basic Properties of Initial Segments of the Natural Numbers and has elements by claim 1 of Basic Properties of Finite Sets; hence the empty word has no length in , and every other word has exactly one length, by Uniqueness of the Number of Elements. For the letter is the word of length .
2. (Concatenation)¶ For the concatenation is defined as follows. If then , and if then . If has length and has length , then is the word of length with
this determines on all of , and consistently, because is the union of the disjoint sets and and is a bijection from onto the latter, by claim 5 of Basic Properties of Initial Segments of the Natural Numbers.
3. (Reversal)¶ The reversal of is the word with , and, if has length , the word of length with
for ; such a exists and is unique by claims 1, 3, 4, 5, 6 and 7 of Properties of the Order on the Natural Numbers, and it lies in because , with the successor map, by claim 6 of that lemma and claims 4 and 1 of Arithmetic of Addition on the Natural Numbers, whence by claim 5 of Properties of the Order on the Natural Numbers.
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.