Jump to navigation Jump to search
- $S = TT'$
Also known as
A prefix is referred to by some sources as an initial part.
Let $abc$ be a string.
Then the prefixes of $abc$ are:
- $\epsilon$, $a$, $ab$ and $abc$
where $\epsilon$ is the null string.
- 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
- 1996: H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability ... (previous) ... (next): $\S 1.3$: Induction on Length of Wffs: Proposition $1.3.2$