29 views

L={a. bn . cm . cn | m,n ≥ 0 }

find CFG of corresponding Language

edited | 29 views
0
source of question?
+1

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

0
just  like l={$a^{n}b^{n}c^{n}$ |n>=1}
0
but c no need to always equal to a or b, it can more then a or b