Alphabets - strings and representation, Theory of Computation

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 a1, a2, . . . , an of symbols will be denoted by the juxtaposition a1a2 ...an. Strings that have zero symbols, called empty strings, will be denoted by e.

{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 αi 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







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
Related Questions
prove following function is turing computable? f(m)={m-2,if m>2, {1,if

design an automata for strings having exactly four 1''s

Intuitively, closure of SL 2 under intersection is reasonably easy to see, particularly if one considers the Myhill graphs of the automata. Any path through both graphs will be a

How useful is production function in production planning?

Construct a Mealy machine that can output EVEN or ODD According to the total no. of 1''s encountered is even or odd.


The Equivalence Problem is the question of whether two languages are equal (in the sense of being the same set of strings). An instance is a pair of ?nite speci?cations of regular

The fact that regular languages are closed under Boolean operations simpli?es the process of establishing regularity of languages; in essence we can augment the regular operations


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