1 1 vote S $\rightarrow$aB S$\rightarrow$bA B $\rightarrow$ b A $\rightarrow$ a B $\rightarrow$ bS A $\rightarrow$ aS B $\rightarrow$ aBB S $\rightarrow$ bAA Using CYK Algorithm prove that each of which can be derived/not derived aabbbb aabbab Theory of Computation cyk-algorithm theory-of-computation + – Anjana Babu 3.2k views answer comment Share Follow Print See all 6 Comments 6 6 Comments reply RAJESHWAR YADAV commented Nov 28, 2016 reply Follow flag only "aabbab" is derived by first productions 0 0 replyShare Anjana Babu commented Nov 28, 2016 reply Follow flag Yes . That I too also know . But I need to learn CYK Approach on this. Can u help ? 0 0 replyShare RAJESHWAR YADAV commented Nov 28, 2016 reply Follow flag https://www.youtube.com/watch?v=sAZ-UOPr4p0 1 1 replyShare Anjana Babu commented Nov 28, 2016 reply Follow flag See here productions are of form B->aBB . What to do in this situvation ? 0 0 replyShare RAJESHWAR YADAV commented Nov 28, 2016 reply Follow flag B ->aBB can be wtriten B ->XY X->a Y - >BB 1 1 replyShare Prajwal Bhat commented Nov 28, 2016 reply Follow flag CYK algorithm only works if the grammar is in CNF form,if not convert it into CNF then apply CYK algorithm Refer this : https://gateoverflow.in/45981/cyk-algo 1 1 replyShare Please log in or register to add a comment.
