The Gateway to Computer Science Excellence
+1 vote
184 views

Let G be a grammar in CFG and let W1,W2 $\epsilon$ L(G) such that |W1|=|W2| then which of the following statement is true ?

(A) Any derivation of W1 has exactly the same number of steps as any derivation of W2

(B) Different derivation have different length

(C) Some derivation of W1 may be shorter the derivation of W2

(D) None of the options

in Theory of Computation by Active (2.4k points)
edited by | 184 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,644 questions
56,531 answers
195,622 comments
101,346 users