Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Question: Let Σ={1,#}and let

Y={w|w=x1#x2#···#xkfork0,eachxi1*,andxixjforij}.

Prove that Y is not regular.

Short Answer

Expert verified

Answer:The given language is not regular language is proved by pumping lemma

Step by step solution

01

Pumping lemma for regular language.

Here the pumping lemma is used to find the language is regular language or not.

a. Assume B is regular language and their L is 0s and 1s. where, Z is belongs to L.

|z|nz=uvwxy|v|1

Here at least 1 is not null.

b. Find a suitable k so that so L is not regular language.

L={anbncn|n0}z=uvwxy,z=anbncn{n=1,z=abc}|z|=3n>n

If we equate both z then we get,

uvwxy=anbncn|vx|1,{n|vx|1}

Then after that,

Let v or x is a part of -

aibjorbicjv=aibjv2=aibjbicjuv2wx2y=ambmcm

From this equation, it is proof that

uv2wx2yL

Therefore,L is not regular language.

02

Regular language or not proved by pumping lemma.

Here ,Σ=1,#, This language is not regular language.

Y=w|w=x1#x2#···#xkfork0,eachxi1*,andxixjforij.

Suppose Y is regular. Let be the pumping length given by the pumping lemma.

Let,s=1p#1p+1#···#12p .

Because sYandsp, by the pumping lemma we can split into three pieces

s=xyzsuchthatfori0xyizY.

Becauserole="math" localid="1660622961343" xypandy0 by the pumping lemma, y must consist of between one and p ones. The string xywould generate between p+1and2p1sbefore the first #. In each case, xi=xjforij.

This violates the pumping lemma, therefore Y is not regular.

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 Vaia!

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

Let D={w|wcontains an even number of a’s and an odd number of b’s and does not contain the substring ab}. Give a DFA with five states that recognizes role="math" localid="1663218927815" Dand a regular expression that generatesrole="math" localid="1663218933181" D.(Suggestion: DescribeD more simply.)

Let A/B={ω|ωχAforsomeχB}.Show that if is regular and is any language, thenA/B is regular.

Use the pumping lemma to show that the following languages arenot regulara.   A1={0η1η2η|n0}b.   A2={ωωω|ω{a,b}*}c.   A3={a2η|n0}(Here,a2ηmeansastringof2ηa's.)a.   A1={0η1η2η|n0}b.   A2={ωωω|ω{a,b}*}c.   A3={a2η|n0}(Here,a2ηmeansastringof2ηa's.)

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).0010*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).*

The construction in Theorem 1.54 shows that every GNFA is equivalent to a GNFA with only two states. We can show that an opposite phenomenon occurs for DFAs. Prove that for every k>1, a language xAk{0,1}exists that is recognized by a DFA with k states but not by one with onlyk-1 states

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.

Sign-up for free