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 programmed prescribed teams in simple ecogrammar 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 nonextended case, can be enlarged. The corresponding language families are compared with each other according to the different underlying L systems (OL, TOL, etc.) of the systems and also with the language families given by the simple eco-grammar systems with prescribed teams. We prove that some inclusions whose properness was left open in [2], are strict.