|
- Context free grammar: Meaning of notation ww^R
A common example in CFG is the palindrome example These examples often contain the wwR w w R notation for the string An example from my class could be: Strings wwR w w R over the alphabet Σ= {0,1} Σ = {0, 1} (a subset of palindromes over Σ Σ), or
- 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
- 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!
- Proving the language $\ {w \in \ {0, 1\}^ {\ast} : w = w^ {R}$, $|w . . .
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 . . .
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 example
- how to determine if a context free language is deterministic or . . .
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 sure of nondeterminism ? for example for L = { WWR } how can we say its deterministic or nondeterministic
- Prove that $\ {ww^R\#ww^R\}$ is not context free
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 \}^* \}$?
Consider the language $L = \ { ww : w \in \ { 1,0 \}^* \}$ I know it's easy to make a PDA for $\ { w w^\text {R} : w \in \ { 0,1 \}^* \}$ where $w^ {\text {R}}$ is
|
|
|