0 votes 0 votes What language does the unrestricted grammar $S\rightarrow S_1B,$ $S_1\rightarrow aS_1b,$ $bB\rightarrow bbbB,$ $aS_1b\rightarrow aa,$ $B\rightarrow \lambda$ derive$?$ Theory of Computation peter-linz peter-linz-edition5 theory-of-computation turing-machine recursive-and-recursively-enumerable-languages proof + – Rishi yadav asked Mar 17, 2019 Rishi yadav 209 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.