in Theory of Computation
196 views
0 votes
0 votes

Suppose that $G$ is a context-free grammar for which $λ ∈ L (G)$. Show that if we apply the
construction in Theorem 6.3, we obtain a new grammar $\widehat{G}$ such that $L(\widehat{G} ) = L (G) –$ {$λ$}.

in Theory of Computation
196 views

Please log in or register to answer this question.

Related questions