Jump to content

CYK (algorithm)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by GregorB (talk | contribs) at 17:35, 26 April 2007 ({{compsci-stub}}). 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 ?