Karl Jones: Created page with "In formal language theory, a string is defined as a finite sequence of members of an underlying base set; this set is called the '''alpha..."

2016-09-16T21:17:21Z

Created page with "In formal language theory, a string is defined as a finite sequence of members of an underlying base set; this set is called the '''alpha..."

New page

In [[formal language]] theory, a [[String (computer science)|string]] is defined as a [[finite sequence]] of members of an underlying base set; this set is called the '''alphabet''' of a string or collection of strings.

== Description ==

The members of the set are called [[Symbol (programming)|symbols]], and are typically thought of as representing letters, characters, or digits.

For example, a common alphabet is {0,1}, the binary alphabet, and a binary string is a string drawn from the alphabet {0,1}. An infinite sequence of letters may be constructed from elements of an alphabet as well.

== See also ==

* [[Combinatorics on words]]
* [[Finite sequence]]
* [[String (computer science)]]
* [[Symbol (programming)]]

== External links ==

* [https://en.wikipedia.org/wiki/Alphabet_(formal_languages) Alphabet (formal languages)] @ Wikipedia.org

[[Category:Logic]]

Alphabet (formal languages) - Revision history

Karl Jones: Created page with "In formal language theory, a string is defined as a finite sequence of members of an underlying base set; this set is called the '''alpha..."