Wwr 3d wwe2. Then L satisfies the pumping lemma, so let p be the pumping length. Ask question Nov 20, 2020 · Start asking to get answers Find the answer to your question by asking. Ask question Jan 14, 2018 · Start asking to get answers Find the answer to your question by asking. I'm trying to prove that $L = \ {ww^R : w \in \ {a,b\}^*\}$ ($w^R$ is the reverse of $w$) is not regular using the pumping lemma. In every cases i have googled so far are example This question would have been perfect for the upcoming Computer Science Stack Exchange. I have L={WW^R | W can be {1}+} So possible strings would be 11, 1111, 111111. I've tried several strings, like apbbap that work with the palindrome language (wwr), but the last x ∈ {a, b} + makes it harder to prove, because it can actually be anything after a palindrome in this string. Let $p$ be the pumping length and $s Aug 22, 2017 · A common example in CFG is the palindrome example. These examples often contain the $\\ ww^R$ notation for the string. The input will be on Tape $\#1$ and the Feb 5, 2019 · im trying to find out, if L is regular or not using pumping lemma. anryr xqnc wjoptx gtgfh zllkk mgvf tlmlxze rat wfv jrxy