The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
Find a context-free grammar for the following language:

    L = { a^m b^m c^k | k <= m }

(in order to show that the language is context-free)
asked in Theory of Computation by (7 points) | 49 views

1 Answer

+2 votes
The language is NOT CFL. And so, CFG can not be written for this language.
answered by Boss (21.7k points)

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

46,668 questions
51,139 answers
66,556 users