Difference between revisions of "Alphabet (formal languages)"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (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...") |
(No difference)
|
Latest revision as of 15:17, 16 September 2016
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 or collection of strings.
Description
The members of the set are called 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
External links
- Alphabet (formal languages) @ Wikipedia.org
