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

Instantaneous description - recognizable language, De?nition (Instantaneous... De?nition (Instantaneous Description) (for both DFAs and NFAs) An instantaneous description of A = (Q,Σ, δ, q 0 , F) , either a DFA or an NFA, is a pair h q ,w i ∈ Q×Σ*, where

Turing machine , Let ? ={0,1} design a Turing machine that accepts L={0^m ... Let ? ={0,1} design a Turing machine that accepts L={0^m 1^m 2^m } show using Id that a string from the language is accepted & if not rejected .

Can you help me in automata questions, i have some questions in automata, c... i have some questions in automata, can you please help me in solving in these questions?

Shell script, shell script to print table in given range shell script to print table in given range

Michael porter, value chain value chain

First model of computation, Computer has a single unbounded precision count... Computer has a single unbounded precision counter which you can only increment, decrement and test for zero. (You may assume that it is initially zero or you may include an explici

Fsa as generators, The SL 2 languages are speci?ed with a set of 2-factors... The SL 2 languages are speci?ed with a set of 2-factors in Σ 2 (plus some factors in {?} Σ and some factors in Σ {?} distinguishing symbols that may occur at the beginning and en

Computations of sl automata, We will specify a computation of one of these ... We will specify a computation of one of these automata by specifying the pair of the symbols that are in the window and the remainder of the string to the right of the window at ea

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

Pushdown automator, draw pda for l={an,bm,an/m,n>=0} n is in superscript draw pda for l={an,bm,an/m,n>=0} n is in superscript