Now the following rules allow deletion of the second component of an ordered pair (i.e. composite variable) if it is adjacent to a terminal symbol.
8. 
9. 
and all possible 
Once, all the second component s are deleted using the above two rules, the original input string is correctly generated. This is the correct derivation the LBA would accept the same string as it had entered one of the final states (implied by use of rule 7).
It is also clear that the CSG G can generate a terminal string only if the LBA accepts it.
Note that the production used here are all context-sensitive. Also, the second components donot produce the string 
. Thus the computation with the empty string as input is not simulated by the CSG.
A proof that any string 
is accepted by the LBA M iff it is generated by the grammar G is exactly similar to one that was produced in Theorems.