Definition:Suffix

Definition

A string $T$ is a suffix of a string $S$ if and only if $S$ can be formed by concatenating another string $T'$ with $T$:

$S = T'T$

Proper Suffix

A proper suffix of a string $S$ is a suffix of $S$ which does not equal the whole of $S$.

Examples

Arbitrary Example

Let $abc$ be a string.

Then the suffixes of $abc$ are:

$\epsilon$, $c$, $bc$ and $abc$

where $\epsilon$ is the null string.

Also see

• Definition:Prefix

• Suffix of String is Substring

Sources

• 1979: John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation ... (previous) ... (next): Chapter $1$: Preliminaries: $1.1$ Strings, Alphabets and Languages