The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
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) –$ {$λ$}.

asked ago in Theory of Computation by Loyal (7.1k points) | 10 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,069 questions
53,206 answers
70,420 users