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.