Jump to content

CYK (algorithm)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Black Kite (talk | contribs) at 00:20, 25 May 2007 (Reverted 1 edit by 202.36.179.65 (talk) to last revision (126185070) by GregorB using VP). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

CYK algorithm (Cook-Younger-Kasami) is a polynomial algorithm for the context-free language membership problem: given a word w and context-free language A, does ?