Revision as of 15:31, 29 April 2006 edit 156.17.163.104 (talk) →The algorithm ← Previous edit		Revision as of 08:13, 2 May 2006 edit undo 64.108.216.199 (talk) →The algorithm Next edit →
Line 8: ==The algorithm== The CYK algorithm is a bottom up algorithm and is important theoretically, since it can be used to constructively prove that the membership problem for context-free languages is decidable. The CYK algorithm for the membership problem is as follows:

CYK algorithm: Difference between revisions