62 questions linked to/from How to show that L = L(G)?
82 views

### Proving that L(G) is the language defined by the CFG G

I have a context-free grammar defined by the production S: S → aSbS ∣ bSaS ∣ ε I need to prove that the CFG "G" can be defined as a language L(G) where L(G) = {w ∈ {a, b}∗ ∶ na(w) = nb(w)}. ...
50 views

2k views

Is the language $L = \{ w \mid w \in (a,b)^* \wedge w \text{ is not a palindrome} \}$, context-free? I think this grammar: $S \rightarrow aSa \mid bSb \mid aAb \mid bAa\\ A \rightarrow aAa \mid bAb \... 1answer 1k views ### PDA or CFG for language$L= \{a^ib^j | 2i \leq 2j \leq 3i, i>0\}$Can someone help with this$L= \{a^ib^j | 2i \leq 2j \leq 3i, i>0\}$1answer 118 views ###$L = \{ w \in \{0, 1, 2\}^*: |0| + |2| = |1| \}\$ where |0| denotes number of 0s in the string w

I have come up with: S→0SX | 1SY | 2SZ | SS | ϵ X→1 Y→0 | 2 Z→1 I think I am wrong. Any directions?

15 30 50 per page