A finite, nonempty ordered set will be called an alphabet if its elements are symbols, or characters. A finite sequence of symbols from a given alphabet will be called a string over the alphabet. A string that consists of a sequence a₁, a₂, . . . , a_n of symbols will be denoted by the juxtaposition a₁a₂ a_n. Strings that have zero symbols, called empty strings, will be denoted by .

{0, 1} is a binary alphabet, and {1} is a unary alphabet. 11 is a binary string over the alphabet {0, 1}, and a unary string over the alphabet {1}.

11 is a string of length 2, |ε| = 0, and |01| + |1| = 3.

Example-The string consisting of a sequence αβ followed by a sequence β is denoted αβ. The string αβ is called the concatenation of α and β. The notation αⁱ is used for the string obtained by concatenating i copies of the string α.

Posted Date: 3/18/2013 1:02:49 AM | Location : United States

Ask an Expert

Related Discussions:- Alphabets - strings and representation, Assignment Help, Ask Question on Alphabets - strings and representation, Get Answer, Expert's Help, Alphabets - strings and representation Discussions

Write discussion on Alphabets - strings and representation
Your posts are moderated

Write your message here..

Related Questions

Decidability, examples of decidable problems examples of decidable problems

Class of local languages is not closed under union, Both L 1 and L 2 are ... Both L 1 and L 2 are SL 2 . (You should verify this by thinking about what the automata look like.) We claim that L 1 ∪ L 2 ∈ SL 2 . To see this, suppose, by way of con

Non-regular languages, Suppose A = (Q,Σ, T, q 0 , F) is a DFA and that Q = ... Suppose A = (Q,Σ, T, q 0 , F) is a DFA and that Q = {q 0 , q 1 , . . . , q n-1 } includes n states. Thinking of the automaton in terms of its transition graph, a string x is recogn

Find a regular expression, Find a regular expression for the regular langua... Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4}

Strictly 2 - local automata, We will assume that the string has been augmen... We will assume that the string has been augmented by marking the beginning and the end with the symbols ‘?' and ‘?' respectively and that these symbols do not occur in the input al

Arden''s theoram, proof of arden''s theoram proof of arden''s theoram

Give a strictly 2-local automaton, Let L 3 = {a i bc j | i, j ≥ 0}. Give ... Let L 3 = {a i bc j | i, j ≥ 0}. Give a strictly 2-local automaton that recognizes L 3 . Use the construction of the proof to extend the automaton to one that recognizes L 3 . Gi

Rubber, Rubber shortnote Rubber shortnote

Deterministic finite automata, conversion from nfa to dfa 0 | 1 ____... conversion from nfa to dfa 0 | 1 ___________________ p |{q,s}|{q} *q|{r} |{q,r} r |(s) |{p} *s|null |{p}

Myhill-nerode theorem, The Myhill-Nerode Theorem provided us with an algori... The Myhill-Nerode Theorem provided us with an algorithm for minimizing DFAs. Moreover, the DFA the algorithm produces is unique up to isomorphism: every minimal DFA that recognizes