@Raphael @Gilles Hello!!
I have to write an O(n^3) algorithm to determine whether a given string w=a_1 a_2 ... a_n is in L(G), where G=(N, Σ ,P, S) is a context-free grammar in Chomsky normal form.
Could you give me some hints how to do that??
I have to write an O(n^3) algorithm to determine whether a given string w=a_1 a_2 ... a_n is in L(G), where G=(N, Σ ,P, S) is a context-free grammar in Chomsky normal form.
Could you give me some hints how to do that??