Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Theorem [ PumpingLemmaforRegularLanguages ] :IfLisaregularlanguage,thenthereisapositiveintegerpsuchthatforeverystringsinLoflengthatleastp,therearestringsx,y , andzsatisfyingthefollowing: 1 . s = xyz 2 . | xy | < = p 3 . | y |

Theorem[PumpingLemmaforRegularLanguages]:IfLisaregularlanguage,thenthereisapositiveintegerpsuchthatforeverystringsinLoflengthatleastp,therearestringsx,y,andzsatisfyingthefollowing:1.s=xyz2.|xy|<=p3.|y|>04.foreveryi in N,xyiz in L
Theorem[PumpingLemmaforRegularLanguages,contrapositive]:LanguageLisnotregularifthefollowingholds:foreverypositiveintegerp,thereisastringsinLoflengthatleastpsuchthatforallstringsx,y,andzwiths=xyzand|xy|<=p,and|y|>0,thereisani in NsuchthatxyizL.Theoperativestatementherehasfournestedquantifiers:Foreverypositiveintegerp,thereisastringsinLoflengthatleastpsuchthatforallstringsx,y,andzwiths=xyz,|xy|<=p,and|y|>0,thereisani in NsuchthatxyizL.GivenalanguageL,considerthefollowing2-playergame:1.player1picksapositiveintegerp2.player2picksastringsinLoflengthatleastp3.Player1picksstringsx,y,andzwiths=xyz,|xy|<=p,and|y|>0,4.Player2picksi in N5.Player2winsifxyizL.Otherwise,Player1wins.ThepumpinglemmacanbeinterpretedtosaythatPlayer2willhaveawinningstrategyforthisgameifandonlyifLisnotregular.Forexample,letLbethelanguageofallstringsofa'sandb'sthatarepalindromes(i.e.,thesameforwardasbackward).Player2'sstrategyis:InStep2,chooseastringofalla'soflengthp,followedbyastringofb'soflengthp,followedagainbyastringofpa's.Instep4,choosei=2.
ExerciseSet3:In1-6,ifthelanguageisregular,writeeitheraregularexpressionoradeterministicFSMforit.Ifitisnotregular,giveawinningstrategyforPlayer2inthe"pumpinglemmagame".1.LetLbethelanguageofallstringsofthecharacters'('and')'thatarebalancedparentheses.2.LetLbethelanguageofallstringsofa'sandb'swithmorea'sthanb's.3.LetLbethelanguageofallstringsofa'sandb'sthathaveatleast2a'sandatleast2b's.4.LetLbethelanguageofallstringsofa'sandb'sthatendwithbb.5.LetLbethelanguageofallstringsofa'sandb'sthatconsistofsomenumberofa'sfollowedbythesamenumberofb's.6.LetLbethelanguageofallstringsofa'sandb'sinwhichthesequenceaboccursatleastonce.7.Beabletostatethepumpinglemmaforregularlanguages.Additionally,exercises2.20-2.25fromchapter2areassigned.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Understanding Oracle APEX 5 Application Development

Authors: Edward Sciore

2nd Edition

1484209893, 9781484209899

More Books

Students also viewed these Databases questions

Question

What category of visualizations did you produce in this lab?

Answered: 1 week ago