Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Theorem [ PumpingLemmaforRegularLanguages ] :IfLisaregularlanguage,thenthereisapositiveintegerpsuchthatforeverystringsinLoflengthatleastp,therearestringsx,y , andzsatisfyingthefollowing: 1 . s = xyz 2 . | xy | < = p 3 . | y |
TheoremPumpingLemmaforRegularLanguages:IfLisaregularlanguage,thenthereisapositiveintegerpsuchthatforeverystringsinLoflengthatleastp,therearestringsx,yandzsatisfyingthefollowing:sxyzxypyforeveryi in Nxyiz in L
TheoremPumpingLemmaforRegularLanguagescontrapositive:LanguageLisnotregularifthefollowingholds:foreverypositiveintegerp,thereisastringsinLoflengthatleastpsuchthatforallstringsx,yandzwithsxyzandxypandythereisani in NsuchthatxyizLTheoperativestatementherehasfournestedquantifiers:Foreverypositiveintegerp,thereisastringsinLoflengthatleastpsuchthatforallstringsx,yandzwithsxyzxypandythereisani in NsuchthatxyizLGivenalanguageL,considerthefollowingplayergame:playerpicksapositiveintegerpplayerpicksastringsinLoflengthatleastpPlayerpicksstringsx,yandzwithsxyzxypandyPlayerpicksi in NPlayerwinsifxyizLOtherwise,Playerwins.ThepumpinglemmacanbeinterpretedtosaythatPlayerwillhaveawinningstrategyforthisgameifandonlyifLisnotregular.Forexample,letLbethelanguageofallstringsofa'sandb'sthatarepalindromesiethesameforwardasbackwardPlayer'sstrategyis:InStepchooseastringofalla'soflengthp,followedbyastringofb'soflengthp,followedagainbyastringofpa's.Instepchoosei
ExerciseSet:Inifthelanguageisregular,writeeitheraregularexpressionoradeterministicFSMforit.Ifitisnotregular,giveawinningstrategyforPlayerinthe"pumpinglemmagame"LetLbethelanguageofallstringsofthecharacters'andthatarebalancedparenthesesLetLbethelanguageofallstringsofa'sandb'swithmorea'sthanb'sLetLbethelanguageofallstringsofa'sandb'sthathaveatleasta'sandatleastbsLetLbethelanguageofallstringsofa'sandb'sthatendwithbbLetLbethelanguageofallstringsofa'sandb'sthatconsistofsomenumberofa'sfollowedbythesamenumberofb'sLetLbethelanguageofallstringsofa'sandb'sinwhichthesequenceaboccursatleastonceBeabletostatethepumpinglemmaforregularlanguages.Additionally,exercisesfromchapterareassigned.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started