Revision as of 11:01, 27 February 2010 edit Hermel (talk \| contribs) Extended confirmed users, Pending changes reviewers 2,052 edits Valiant's algorithm ← Previous edit		Revision as of 11:03, 27 February 2010 edit undo Hermel (talk \| contribs) Extended confirmed users, Pending changes reviewers 2,052 edits →References: wikify Next edit →
Line 88: * [[Tadao Kasami\|T. Kasami]] (1965). An efficient recognition and syntax-analysis algorithm for context-free languages. Scientific report AFCRL-65-758, Air Force Cambridge Research Lab, [[Bedford, MA]]. * Daniel H. Younger (1967). Recognition and parsing of context-free languages in time ''n''<sup>3</sup>. ''Information and Control'' 10(2): 189–208. * D.[[Donald E. Knuth]]. ''The Art of Computer Programming Volume 2: Seminumerical Algorithms''. Addison-Wesley Professional; 3 edition (November 14, 1997). ISBN 978-0201896848. pp. 501. * Martin Lange and Hans Leiß. [http://www.informatica-didactica.de/InformaticaDidactica/LangeLeiss2009 ''To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm''.] Informatica Didactica 8, 2009. [http://www.informatica-didactica.de/InformaticaDidactica/LangeLeiss2009.pdf (pdf)] * [[Leslie G. Valiant]]. ''General context-free recognition in less than cubic time''. [[Journal of Computer and System Sciences]], 10:2 (1975), 308–314. ==External links==

CYK algorithm: Difference between revisions