# Definition:String/Finite

Jump to navigation
Jump to search

It has been suggested that this page or section be merged into Definition:Word (Formal Systems).To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{Mergeto}}` from the code. |

## Definition

Let $\AA$ be an alphabet of symbols.

A **string** $S$ in $\AA$ 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**.