–2 votes –2 votes L={an . bn . cm . cn | m,n ≥ 0 } find CFG of corresponding Language Theory of Computation context-free-grammar + – amit166 asked Sep 19, 2018 • edited Sep 19, 2018 by Shaik Masthan amit166 334 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Mk Utkarsh commented Sep 19, 2018 reply Follow Share source of question? 0 votes 0 votes Shaik Masthan commented Sep 19, 2018 i edited by Shaik Masthan Sep 19, 2018 reply Follow Share Given language is equivalent to L = { an . bn . cp | n ≥ 0, p ≥ n } ===> to comparissions required at a time ∴ it is Not CFL ==> You didn't have CFG 1 votes 1 votes amit166 commented Sep 21, 2018 reply Follow Share just like l={$a^{n}b^{n}c^{n}$ |n>=1} 0 votes 0 votes Shaik Masthan commented Sep 21, 2018 reply Follow Share but c no need to always equal to a or b, it can more then a or b 0 votes 0 votes Please log in or register to add a comment.
