Cocke–Younger–Kasami algorithm (CFG Recognition CFG Problems)

From Algorithm Wiki
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3} * |G|)$ == Space Complexity == $O(n^{2})$ cells (https://core.ac.uk/download/pdf/158319955.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Double-tape TM == Year == 1968 == Reference == https://core.ac.uk/download/pdf/158319955.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3} * |G|)$

Space Complexity

$O(n^{2})$ cells

(https://core.ac.uk/download/pdf/158319955.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Double-tape TM

Year

1968

Reference

https://core.ac.uk/download/pdf/158319955.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Cocke–Younger–Kasami_algorithm_(CFG_Recognition_CFG_Problems)&oldid=44882"