vault backup: 2026-08-04 13:12:55
This commit is contained in:
@@ -23,7 +23,7 @@ A word (or _string_) is a finite sequence $w = a_1 a_2 ... a_n$ if characters fr
|
|||||||
> We will use small letters to describe strings that are part of a language.
|
> We will use small letters to describe strings that are part of a language.
|
||||||
|
|
||||||
> [!EXAMPLE]
|
> [!EXAMPLE]
|
||||||
> $"aa", "ab", "bba"$ and $"baab"$ are strings over $Sigma = {a, b}.
|
> $"aa", "ab", "bba"$ and $"baab"$ are strings over $Sigma = {a, b}$.
|
||||||
|
|
||||||
#### Length of a string
|
#### Length of a string
|
||||||
The _length_ $abs(x)$ of a string $x = a_1 ... a_n$ is its number $abs(x) = n$ of characters.
|
The _length_ $abs(x)$ of a string $x = a_1 ... a_n$ is its number $abs(x) = n$ of characters.
|
||||||
|
|||||||
Reference in New Issue
Block a user