Page 1 of 1
Use the pumping lemma to show that the language L = {ww/w = {a, b}* } is not regular. This is the language that is made
Posted: Thu Jun 30, 2022 7:16 am
by answerhappygod
- Use The Pumping Lemma To Show That The Language L Ww W A B Is Not Regular This Is The Language That Is Made 1 (74.83 KiB) Viewed 43 times
Use the pumping lemma to show that the language L = {ww/w = {a, b}* } is not regular. This is the language that is made up of all strings containing any combination of a's and b's, followed immediate by itself. For example, here are some strings in the language: abab babbab aaabaaab Notice that each string is made up of a string (composed of a's and b's), followed immediately by itself. Be sure to give a full proof, describing your reasoning as you go.