Category:Substrings
Jump to navigation
Jump to search
This category contains results about Substrings.
Definitions specific to this category can be found in Definitions/Substrings.
Let $\LL$ be a formal language with alphabet $\AA$.
Let $S$ be a string in $\AA$.
Let $T$ be a string in $\AA$ such that:
- $S = S_1 T S_2$
where:
- $S_1$ and $S_2$ are strings in $\AA$ (possibly null)
- $S_1 T S_2$ is the concatenation of $S_1$, $T$ and $S_2$.
Then $T$ is called a substring of $S$.
Pages in category "Substrings"
The following 2 pages are in this category, out of 2 total.