The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
40 views
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free

                                                 $L = \{a^nb^m:\text{n is prime or m is prime}\}$.
in Theory of Computation by Boss (10.9k points) | 40 views

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
49,830 questions
54,800 answers
189,506 comments
80,732 users