> For the complete documentation index, see [llms.txt](https://mandober.gitbook.io/math-debrief/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mandober.gitbook.io/math-debrief/600-toc/toc.glossary.md).

# Theory of computation: GLOSSARY

## Alphabet

In formal language theory, a string is defined as a finite sequence of members of an underlying base set which is called the alphabet (of a string).

## String

In formal language theory, a string is defined as a finite sequence of members of an underlying base set; this set is called the alphabet of a string.