Question

Let Σ = {0, 1}. Consider the language A = {ww | w ∈ 0Σ*}. Give...

Let Σ = {0, 1}. Consider the language A = {ww | w ∈ 0Σ*}. Give a string in the language A that has length at least p.

Homework Answers

Answer #1

ans : 01011 01011

-----------------------------------------------

* contain any string that start with 0 ------------>( 0 )(Σ* )

Σ = {0, 1}

Σ* -------> conatain all string of any length over 0,1

then examples strings of* are

w=011,0101011,000000

lets take w = 01011

string in the language A is = w w

                                        =01011 01011

                                       

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let Σ = {0, 1}. Consider the language A = {w | w has an odd...
Let Σ = {0, 1}. Consider the language A = {w | w has an odd length}. Give a string in the language A that has length at least p.
Let Σ = {0, 1}. Give a regular expression that expresses the language {w | w...
Let Σ = {0, 1}. Give a regular expression that expresses the language {w | w contains exactly two 0s}.
Consider the language L = { w w : w ∈ { 0 , 1 }...
Consider the language L = { w w : w ∈ { 0 , 1 } ∗ } is not context-free. Note that this is the language of all strings that consist of some combination of 0s and 1s, followed immediately by that same combination of 0s and 1s. For example, 0101, 101101, and 110110 are all in the language because they consist of a string followed by itself. Can you build a PDA to recognize this language? (Hint: you...
Consider the language L3 over alphabet Σ = { a, b }, L3 = { w...
Consider the language L3 over alphabet Σ = { a, b }, L3 = { w ∈ Σ* | w is a palindrome of any length}. Construct a PDA that recognizes L3. Implement that PDA in JFLAP
Let Σ = {0,1}. Prove that the language { w | w contains the substring 01001...
Let Σ = {0,1}. Prove that the language { w | w contains the substring 01001 } is regular by providing a finite automaton to recognize the language. Include a state diagram, formal description, and informal justification for the correctness of your automaton.
Using Pumping lemma to prove the below language is not regular Let Σ2 = {[ 0...
Using Pumping lemma to prove the below language is not regular Let Σ2 = {[ 0 0 ] , [ 0 1 ] , [ 1 0 ] , [ 1 1 ]} . Consider each row to be a binary number and let L3 = w ∈ Σ ∗ 2 | the bottom row of w is the square of the top row of w . For example, [ 0 1 ] [ 0 0 ] [ 1 0...
What is the regular expression for the language L={w| w starts with 1 and has odd...
What is the regular expression for the language L={w| w starts with 1 and has odd length}? The alphabet of the language is {0, 1};
Let WW be a subset of a vector space VV. By justifying your answer, determine whether...
Let WW be a subset of a vector space VV. By justifying your answer, determine whether WW is a subspace of VV. (a) [5 marks] W={(x1,x2,x3,x4):x1x4=0}W={(x1,x2,x3,x4):x1x4=0} and V=R4V=R4. (b) [5 marks] W={A:|A|≥1}W={A:|A|≥1} and V=M3,3V=M3,3, where |A||A| is the determinant of AA. (c) [10 marks] W={p(x)=a0+a1x+a2x2+a3x3:a0=a1anda2=a3}W={p(x)=a0+a1x+a2x2+a3x3:a0=a1anda2=a3} and V=P3V=P3.
Design a DFA accepting the language of all strings over Σ = {0, 1} with the...
Design a DFA accepting the language of all strings over Σ = {0, 1} with the property that the number of 0s and the number of 1s in a string are both odd.
Let L1 be the language of the Regular Expression 1(1 + 0)*. Let L2 be the...
Let L1 be the language of the Regular Expression 1(1 + 0)*. Let L2 be the language of the Regular Expression 11* 0. Let L3 be the language of the Regular Expression 1* 0. Which of the following statements are true? L2 L1 L2 L3 L1 L2 L3 L2