Revision as of 22:42, 22 August 2003 edit Zashaw (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 1,616 edits m I think this is the more conventional term ← Previous edit		Revision as of 04:20, 14 November 2003 edit undo 24.170.198.69 (talk) No edit summary Next edit →
Line 18: ::::For each production R<sub>A</sub> -> R<sub>B</sub> R<sub>C</sub> :::::If P[j,k,B] and P[j+k,i-k,C] then set P[j,i,A] = true :If RP[1,n,1] is true ::Then string is member of language ::Else string is not member of language

CYK algorithm: Difference between revisions