Remarks on Simple Eco-Grammar Systems with Prescribed Teams

In this paper, the simple eco-grammar systems with prescribed teams of ter Beek [2] are reconsidered. We show that limited L systems can be simulated by such systems. Furthermore, we introduce the concept of programming which is imposed upon the prescribed teams of the systems. Depending on the success of the application of a team to the actual state of the system, it is specified which teams are allowed to be applied in the next step. By this mean, the generative power of the systems, at least for the non-extended case, can be enlarged. The corresponding language families are compared with each other according to the different underlying L systems (0L, T0L, etc.) of the systems and also with the language families given by the simple eco-grammar systems with prescribed teams. Some strict inclusions could be proved which were noted to be open in [2].