The Gateway to Computer Science Excellence
–2 votes
29 views

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

find CFG of corresponding Language

in Theory of Computation by Junior (745 points)
edited by | 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

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,157 answers
193,767 comments
93,747 users