From ProofWiki
Jump to navigation Jump to search

This category contains definitions related to Substrings.
Related results can be found in Category: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$


$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 "Definitions/Substrings"

The following 3 pages are in this category, out of 3 total.