0 votes 0 votes Find a context-free grammar for $Σ =$ {$a, b$} for the language $L =$ {$a^nww^Rb^n : w ∈ Σ^*, n ≥ 1$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 190 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S→aSb | aAb A→aAa | bAb | λ JAINchiNMay answered Oct 11, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.