World Library  
Flag as Inappropriate
Email this Article

Alphabet (computer science)

Article Id: WHEBN0004292269
Reproduction Date:

Title: Alphabet (computer science)  
Author: World Heritage Encyclopedia
Language: English
Subject: Computational complexity theory, Decision problem, Formal language, Star height problem, String searching algorithm, Symbol, Tree automaton, Coding theory, Deterministic finite automaton, Nondeterministic finite automaton
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Alphabet (computer science)

In computer science and mathematical logic, a non-empty set is called alphabet when its intended use in string operations shall be indicated. Its members are then commonly called symbols or letters, e.g. characters or digits.[1] For example a common alphabet is {0,1}, the binary alphabet. A finite string is a finite sequence of letters from an alphabet; for instance 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.

Given an alphabet \Sigma, we write \Sigma^* to denote the set of all finite strings over the alphabet \Sigma. Here, the {}^* denotes the Kleene star operator, so \Sigma^* is also called the Kleene closure of \Sigma. We write \Sigma^\infty (or occasionally, \Sigma^\N or \Sigma^\omega) to denote the set of all infinite sequences over the alphabet \Sigma.

For example, using the binary alphabet {0,1}, the strings ε, 0, 1, 00, 01, 10, 11, 000, etc. are all in the Kleene closure of the alphabet (where ε represents the empty string).

Alphabets are important in the use of formal languages, automata and semiautomata. In most cases, for defining instances of automata, such as deterministic finite automata (DFAs), it is required to specify an alphabet from which the input strings for the automaton are built.

If L is a formal language, i.e. a (possibly infinite) set of finite-length strings, the alphabet of L is the set of all symbols that may occur in any string in L. For example, if L is the set of all variable identifiers in the programming language C, L’s alphabet is the set { a, b, c, ..., x, y, z, A, B, C, ..., X, Y, Z, 0, 1, 2, ..., 7, 8, 9, _ }.

See also

References

  1. ^ Ebbinghaus, H.-D.; Flum, J.; Thomas, W. (1994), Mathematical Logic (2nd ed.), New York: Springer, p. 11, ISBN , By an alphabet \mathcal{A} we mean a nonempty set of symbols. 

Literature

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.