Context free grammar: Meaning of notation ww^R
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 $\\ ww^R$ over the …
pumping lemma: ww^R not regular - Mathematics Stack Exchange
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 ...
formal languages - Build a deterministic turing machine to decide $L ...
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 and the like?
computer science - two tape Turing machine that accepts L = {ww | w ...
Apr 3, 2017 · Describe a Turing Machine with two tapes that accepts $$L = \ {ww \mid w \in \ {0,1\}^*\} $$ in a linear time complexity. The input will be on Tape $\#1$ and the ...
Proving the language $\ {w \in \ {0, 1\}^ {\ast} : w = w^ {R}$, $|w ...
Nov 20, 2020 · Start asking to get answers Find the answer to your question by asking. Ask question
Is it possible to make a PDA for $\ { ww : w \in \ { 0,1 \}^* \}$?
Start asking to get answers Find the answer to your question by asking. Ask question
formal languages - Pumping lemma, L= {WW^R | W can be {1 ...
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 so far are …
Construct PDA that accepts the language $L = \ {w_1cw_2 : w_1, w_2 \in ...
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 to take off!
Exitstance of DPA of L = $\ {ww^r\}$ - Mathematics Stack Exchange
Jan 14, 2018 · Start asking to get answers Find the answer to your question by asking. Ask question
computer science - Proving that $\ {ww^rx | w,x \in \ {a,b ...
Apr 14, 2016 · I need to prove that L = {wwrx | w, x ∈ {a, b} +} is non regular. First of all I assume that L is regular. Then L satisfies the pumping lemma, so let p be the pumping length. I've tried several …