The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

Complete the proof of Theorem 6.4.

Theorem 6.4

Let $G = (V, T, S, P )$ be any context-free grammar without $λ$-productions. Then there exists a context-free grammar $\widehat{G}=(\widehat{V},\widehat{T},S,\widehat{P})$ that does not have any unit-productions and that is equivalent to $G$.

asked in Theory of Computation by Boss (14k points) | 16 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
49,586 questions
54,193 answers
71,147 users