/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q35P Let Σ2 be the same as in Proble... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

Let Σ2 be the same as in Problem 1.33. Consider the top and bottom rows to be strings of 0s and 1s, and letE={w∈∑*2| the bottom row of w is the reverse of the top row of w}. Show that is E not regular.

Short Answer

Expert verified

The given language L is not a regular language.

Step by step solution

01

Consider the expression E is regular

Expression is not regular

Consider that

Proof:The bottom row of the string is the reverse of the top row of the string.

In order to prove that bottom row of string is the reverse of the top row of the string user need to prove this with the help of contradiction.

First it is to be assumed that the expression E is a regular language.

02

To prove that

Suppose, the constant variable p is associated with expression E

Choose the string. This is because s∈L.

Now, the string s is being partitioned into three pieces such that,

s=xyzwhere p⩾q

For any division of y=uvw, the value of v=10mbut the condition is that 0<m⩽p

For any value of i⩾0, suppose value of i is assumed to be 2.

s=xyz

Now, putting the value of y here,

Becausem>0and1p+m0p≠(0p+m1p)R

By the above contradiction, it is being proved that the top row of the string is not the reverse of the bottom row of the string.

This implies,xuv2wz∈L

Thus, by the pumping lemma of proof by contradiction, it is being proved that the given language L is not a regular language.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Convert the following regular expressions to NFAs using the procedure given in Theorem 1.54. In all parts,Σ={a,b}.

a.   a(abb)*∪bb.    a+∪(ab)+c.    (a∪b+)a+b+

Recall that string x is a prefix of string y if a string z exists where xz=y, and that x is a proper prefix of y if in addition x6=y. In each of the following parts, we define an operation on a language A. Show that the class of regular languages is closed under that operation.

a)NOPREFIXA={w∈A|noproperprefixofwisamemberofA}.b)NOEXTENDA={w∈A|wisnottheproperprefixofanystringinA}.

An all- NFAMisa5-tuple(Q,Σ,δ,q0,F)that accepts x∈Σ* if every possible state that M could be in after reading input M is a state from F. Note, in contrast, that an ordinary NFA accepts a string if some state among these possible states is an accept state. Prove that all-NFAs recognizes the class of regular languages.

The pumping lemma says that every regular language has a pumping length P , such that every string in the language can be pumped if it has length p or more. If P is a pumping length for language A, so is any length p'⩾pThe minimum pumping length for A is the smallest p that is a pumping length for A . For example, if A=01*, the minimum pumping length is 2.The reason is that the string s=0is in A and has length 1 yet s cannot be pumped; but any string A in of length 2 or more contains a 1 and hence can be pumped by dividing it so that x=0,y=1,andzis the rest. For each of the following languages, give the minimum pumping length and justify your answer.

a).0001*b).0*1*c).001∪0*1*d).0*1+0+1*∪10*1

role="math" localid="1660797009042" e).(01)*f).∈g).1*01*01*h).10(11*0)*

i).1011j).∑*

For languages A and B let the perfect shuffle of A and B be the language

{Ӭ|Ӭ=a1b1...ak bk,where  a1...ak ∈ A  and  b1...bk∈ B,each  ai,bi∈∑}.

Show that the class of regular languages is closed under perfect shuffle.

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.