Jump to content

CYK (algorithm)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Neworder1 (talk | contribs) at 13:10, 21 April 2007 (new page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) โ† Previous revision | Latest revision (diff) | Newer revision โ†’ (diff)

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