The Gateway to Computer Science Excellence
0 votes
Give a counterexample to show that the following construction fails to prove that the class of context-free languages is closed under star. Let $A$ be a $\text{CFL}$ that is generated by the $\text{CFG}$  $G = (V, \Sigma, R, S).$ Add the new rule $S\rightarrow SS$ and call  the resulting grammar $G'.$This grammar is supposed to generate $A^{*}.$
in Theory of Computation by Veteran (60.6k points)
edited by | 21 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,833 questions
57,689 answers
107,287 users