Set of Finite Strings/Examples/Over Two Elements

Example of Set of Finite Strings

Let $\Sigma$ be the alphabet defined as:

$\Sigma = \set {0, 1}$

Then the set of finite strings $\Sigma^*$ over $\Sigma$ is:

$\Sigma^* = \set {\epsilon, 0, 1, 00, 01, 10, 11, 000, 001, \ldots}$

where $\epsilon$ denotes the null string.

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