recategorized by
3,561 views
1 votes
1 votes

If the parse tree of a word w generated by a Chomsky form grammar has no path of length greater than i, then the word w is of length

  1. no greater than $2^{i+1}$
  2. no greater than $2^i$
  3. no greater than $2^{i-1}$
  4. no greater than $i$
recategorized by

2 Answers

Answer:

Related questions

1 votes
1 votes
1 answer
2
go_editor asked Jul 13, 2016
2,964 views
A* algorithm is guaranteed to find an optimal solution ifh’ is always 0g is always 1h’ never overestimates hh’ never underestimates h
1 votes
1 votes
1 answer
4
go_editor asked Jul 13, 2016
2,528 views
A cryptarithmetic problem of the typeCan be solved efficiently usingdepth first techniquebreadth first techniqueconstraint satisfaction techniquebidirectional technique