CYK algorithm: Difference between revisions

Revision as of 22:18, 20 July 2010

Revision as of 08:11, 24 July 2010

Line 81:

* Daniel H. Younger (1967). Recognition and parsing of context-free languages in time ''n''³. ''Information and Control'' 10(2): 189–208.

* [[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.

* {{Citation

* 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)]

| last=Lange

| first=Martin

| last2=Leiß

| first2=Hans

| title=To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm

| year=2009

| journal=Informatica Didactica

| volume=8

| url=http://www.informatica-didactica.de/cmsmadesimple/index.php?page=LangeLeiss2009

| place=[http://www.informatica-didactica.de/cmsmadesimple/uploads/Artikel/LangeLeiss2009/LangeLeiss2009.pdf pdf]

}}

*{{Citation

| last=Sipser