Embed presentation
Download to read offline

This document discusses a problem involving generating graphs using the CYK algorithm. The number of graphs that can be generated from a given input of length N is calculated using the equation (K-1)^i+1, where this is summed from i=1 to N. This equation provides the number of graphs that can be obtained from CYK parsing with an input of length N.
