The Gateway to Computer Science Excellence
0 votes
43 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 (11.6k points) | 43 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
50,741 questions
57,243 answers
198,012 comments
104,604 users