# Definition:Finite Sequence

Jump to navigation
Jump to search

## Definition

A **finite sequence** is a sequence whose domain is finite.

### Length of Sequence

The **length** of a **finite sequence** is the number of terms it contains, or equivalently, the cardinality of its domain.

## Also known as

Some sources use the term **word** in place of **finite sequence**.

Compare the definition of word in the context of formal systems.

Some treatments, in order to stress the difference between a **finite sequence** and infinite sequence, present this term as **finite-sequence**.

## Also see

- Definition:Ordered Tuple: a
**finite sequence**whose domain is specifically $\set {1, 2, \ldots, n}$ for some $n \in \N$

- Results about
**finite sequences**can be found**here**.

## Sources

- 1958: J.A. Green:
*Sequences and Series*... (previous) ... (next): Chapter $1$: Sequences: $1$. Infinite Sequences - 1960: Paul R. Halmos:
*Naive Set Theory*... (previous) ... (next): $\S 11$: Numbers - 1965: Seth Warner:
*Modern Algebra*... (previous) ... (next): Chapter $\text {III}$: The Natural Numbers: $\S 18$: Induced $N$-ary Operations - 1971: Robert H. Kasriel:
*Undergraduate Topology*... (previous) ... (next): $\S 1.15$: Sequences: Definition $15.2$ - 1993: Keith Devlin:
*The Joy of Sets: Fundamentals of Contemporary Set Theory*(2nd ed.) ... (previous) ... (next): $\S 1$: Naive Set Theory: $\S 1.7$: Well-Orderings and Ordinals - 1998: David Nelson:
*The Penguin Dictionary of Mathematics*(2nd ed.) ... (previous) ... (next):**finite sequence** - 1998: David Nelson:
*The Penguin Dictionary of Mathematics*(2nd ed.) ... (previous) ... (next):**sequence** - 2008: David Nelson:
*The Penguin Dictionary of Mathematics*(4th ed.) ... (previous) ... (next):**finite sequence** - 2008: David Nelson:
*The Penguin Dictionary of Mathematics*(4th ed.) ... (previous) ... (next):**sequence** - 2010: Raymond M. Smullyan and Melvin Fitting:
*Set Theory and the Continuum Problem*(revised ed.) ... (previous) ... (next): Chapter $3$: The Natural Numbers: $\S 8$ Definition by finite recursion

This page may be the result of a refactoring operation.As such, the following source works, along with any process flow, will need to be reviewed. When this has been completed, the citation of that source work (if it is appropriate that it stay on this page) is to be placed above this message, into the usual chronological ordering.In particular: Compare Definition:Ordered TupleIf you have access to any of these works, then you are invited to review this list, and make any necessary corrections.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 `{{SourceReview}}` from the code. |

- 2012: M. Ben-Ari:
*Mathematical Logic for Computer Science*(3rd ed.) ... (previous) ... (next): Appendix $\text{A}.3$: Definition $\text{A}.12$