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. 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. An example from my class could be: Strings $\\ …

This question would have been perfect for the upcoming Computer Science Stack Exchange. So, if you like to have a place for questions like this one, please go ahead and help this proposal …

Sep 6, 2024 · Are you interested in finding a determistic algorithm to solve the problem? Or do you really need to know a Turing machine specification, with states and transition functions …

Feb 5, 2019 · im trying to find out, if L is regular or not using pumping lemma. I have L={WW^R | W can be {1}+} So possible strings would be 11, 1111, 111111. In every cases i have googled …

Jun 9, 2018 · how to determine if a context free language is deterministic or nondeterministic in general to make sure a language is deterministic we can make DPDA for it how can we make …

Apr 14, 2016 · I've tried several strings, like apbbap a p b b a p that work with the palindrome language (wwr w w r), but the last x∈ {a,b}+ x ∈ {a, b} + makes it harder to prove, because it …

Jan 18, 2015 · 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. Ask question

and tried to show that other set is irregular. But even if you were to succeed in that, it wouldn't help you solve the problem, because the question wasn't about ϵ,abbbba,abbabbbbabba, … ϵ, …