Register

Doubt

710 views
0 votes
0 votes
L(G)={$a^nb^nc^n$ | n>=1}

S->aAc

A->bA | b

can someone tell me what is wrong with this approach?
User Avatar

1 Answer

Best answer
1 votes
1 votes

it can't be expressed by context free grammar.

CSG is possible.☺

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
2 answers
1
Jiten008 asked Oct 24, 2023
367 views
TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
User Avatar
1 votes
1 votes
1 answer
2
aditi19 asked Mar 7, 2019
863 views
CFG Doubt
what is the CFG for the language L=w where number of a’s in w+number of b’s in w=number of c’s in w how to approach this?
what is the CFG for the language L=w where number of a’s in w+number of b’s in w=number of c’s in whow to approach this?
User Avatar
0 votes
0 votes
1 answer
3
aditi19 asked Mar 2, 2019
826 views
CFG Doubt
S->A | B A→ ε B->aBb B->b what is the complement of the language of this grammar?
S->A | BA→ εB->aBbB->bwhat is the complement of the language of this grammar?
User Avatar
0 votes
0 votes
0 answers
4
jatin khachane 1 asked Oct 14, 2018
318 views
TOC SELF DOUBT
L = { w ∈ {a,b}* : a(w) = b(w) } We're using the notation: a(w) = number of a's in a string w b(w) = number of b's in a string w S⇾ aSbS | bSaS | ε Doubt: Is the same language generated by below grammar also: S⇾ SS | aSb | bSa | ε
L = { w ∈ {a,b}* : a(w) = b(w) }We're using the notation:a(w) = number of a's in a string w b(w) = number of b's in a string w S⇾ aSbS | bSaS | ε Doubt:Is the same l...
User Avatar
Link Copied!