0 votes 0 votes Using the grammar $G$ of Example $7.34,$use the $CYK$ algorithm to determine whether each of the following strings is in $L(G):$ $ababa$ $baaab$ $aabab$ Theory of Computation ullman theory-of-computation context-free-language context-free-grammar + – admin asked Apr 11, 2019 admin 257 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.