Characterization of RE using CD grammar systems with two registers and RL rules

We prove that each recursively enumerable language can be generated by a cooperating distributed grammar system with two Q+ registers and right-linear rules.