The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
40 views
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) | 40 views

1 Answer

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


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

35,535 questions
42,875 answers
121,904 comments
42,216 users