The Gateway to Computer Science Excellence
+1 vote
29 views
which of the  following is false?

1) every CFG  with useless symbols can be converted into an equivalent grammar with no useless symbols

2) every CFG  with ε - production may be converted into an equivalent grammar  without ε - productions that generates the same language.
in Theory of Computation by Active (2.3k points) | 29 views
+1
The second one will be false.

Lets consider the following context free Grammar

S->AB/a

A->aAB/ε

B->b/ε

Lets try to remove ε

S->AB/A/B/a/ε

A->aAB/aA/aB/a

B->b

We can't eliminate ε since the start symbol produces ε in other words language represented by the grammar contains ε.
0
ok i got it thank u

Please log in or register to answer this question.

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,737 questions
57,405 answers
198,628 comments
105,467 users