0 votes 0 votes Prove that constructed grammar cannot generate any sentence with $a\space b$ in it. $S\rightarrow S_1B,$ $S_1\rightarrow aS_1b,$ $bB\rightarrow bbbB,$ $aS_1b\rightarrow aa,$ $B\rightarrow \lambda$ Theory of Computation peter-linz peter-linz-edition5 theory-of-computation proof turing-machine recursive-and-recursively-enumerable-languages + – Rishi yadav asked Mar 17, 2019 Rishi yadav 147 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.