0 votes 0 votes Show that $L =$ {$w ∈$ {$a,b,c$}$^* : |w| = 3n_a(w)$} is a context-free language. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar context-free-language + – Naveen Kumar 3 asked Apr 13, 2019 • edited Apr 14, 2019 by Naveen Kumar 3 Naveen Kumar 3 311 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S-->Sabb | aSbb | abSb | abbS | Sbba | bSba | bbSa | bbaS | Sbab | bSab | baSb | babS Sacc | aScc | acSc | accS | Scac | cSac | caSc | cacS | Sacc | aScc | acSc | accS | SS | λ i think this will be correct. JAINchiNMay answered Oct 11, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.