in Theory of Computation
263 views
0 votes
0 votes

Complete the proof of Theorem 6.3.

Theorem 6.3
Let $G$ be any context-free grammar with $λ$ not in $L (G)$. Then there exists an equivalent grammar $\widehat{G}$
having no $λ$-productions.

in Theory of Computation
263 views

Please log in or register to answer this question.

Related questions