Beginner
Theory of Computation
Q33 / 100
What is the CYK (Cocke-Younger-Kasami) algorithm?
Correct! Well done.
Incorrect.
The correct answer is B) A dynamic programming algorithm that parses a string using a CNF grammar in O(n³ |G|) time
B
Correct Answer
A dynamic programming algorithm that parses a string using a CNF grammar in O(n³ |G|) time
Explanation
CYK checks membership in a CFG (in CNF) using DP on all substrings. It fills a triangular table bottom-up in O(n³) time, determining if a string is generated by the grammar.
Progress
33/100