KNOWPIA
WELCOME TO KNOWPIA

In formal language theory, an **alphabet** is a non-empty set of symbols/glyphs, typically thought of as representing letters, characters, or digits^{[1]} but among other possibilities the "symbols" could also be a set of phonemes (sound units). Alphabets in this technical sense of a set are used in a diverse range of fields including logic, mathematics, computer science, and linguistics. An alphabet may have any cardinality ("size") and depending on its purpose maybe be finite (e.g., the alphabet of letters "a" through "z"), countable (e.g., ), or even uncountable (e.g., ).

Strings, also known as "words", over an alphabet are defined as a sequence of the symbols from the alphabet set.^{[2]} For example, the alphabet of lowercase letters "a" through "z" can be used to form English words like "iceberg" while the alphabet of both upper and lower case letters can also be used to form proper names like "Wikipedia". A common alphabet is {0,1}, the **binary alphabet**, and a "00101111" is an example of a binary string. Infinite sequence of symbols may be considered as well (see Omega language).

It is often necessary for practical purposes to restrict the symbols in an alphabet so that they are unambiguous when interpreted. For instance, if the two-member alphabet is {00,0}, a string written on paper as "000" is ambiguous because it is unclear if it is a sequence of three "0" symbols, a "00" followed by a "0", or a "0" followed by a "00".

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

Given an alphabet , the set of all strings of length over the alphabet is indicated by . The set of all finite strings (regardless of their length) is indicated by the Kleene star operator as , and is also called the Kleene closure of . The notation indicates the set of all infinite sequences over the alphabet , and indicates the set of all finite or infinite sequences.

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. In these applications, an alphabet is usually required to be a finite set, but is not otherwise restricted.

When using automata, regular expressions, or formal grammars as part of string-processing algorithms, the alphabet may be assumed to be the character set of the text to be processed by these algorithms, or a subset of allowable characters from the character set.

**^**Ebbinghaus, H.-D.; Flum, J.; Thomas, W. (1994).*Mathematical Logic*(2nd ed.). New York: Springer. p. 11. ISBN 0-387-94258-0.By an

*alphabet*we mean a nonempty set of*symbols*.**^**Rautenberg, Wolfgang (2010).*A Concise Introduction to Mathematical Logic*(PDF) (Third ed.). Springer. p. xx. ISBN 978-1-4419-1220-6.If 𝗔 is an

*alphabet*, i.e., if the elements 𝐬 ∈ 𝗔 are symbols or at least named symbols, then the sequence (𝐬_{1},...,𝐬_{n})∈𝗔^{n}is written as 𝐬_{1}···𝐬_{n}and called a*string*or a*word*over 𝗔.

- John E. Hopcroft and Jeffrey D. Ullman,
*Introduction to Automata Theory, Languages, and Computation*, Addison-Wesley Publishing, Reading Massachusetts, 1979. ISBN 0-201-02988-X.