Definition:String/Finite

From ProofWiki
Jump to navigation Jump to search

Definition

Let $\mathcal A$ be an alphabet of symbols.

A string $S$ in $\mathcal A$ is a finite string if and only if the sequence of symbols of which it is composed is finite.


Also known as

A finite string, in the strict context of formal systems, is usually referred to as a word.


Also see