Formal languages
k-limited OL systems and languages
Journal of Information Processing and Cybernetics
On k-uniformly-limited TOL systems and languages
Journal of Information Processing and Cybernetics
A weak iteration theorem for k-limited EOL systems
Journal of Information Processing and Cybernetics
Teams in grammar systems: hybridity and weak rewriting
Acta Cybernetica - Special issue: selected papers of the workshop grammar systems: recent results and perspectives, Budapest, July 1996
Team behaviour in eco-grammar systems
Theoretical Computer Science
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Remarks on simple eco-grammar systems with prescribed teams
Journal of Automata, Languages and Combinatorics
Function-dependent teams in eco-grammar systems
Theoretical Computer Science
Dynamical Teams in Eco-Grammar Systems
Fundamenta Informaticae
Multi-limited simple eco-grammar systems with prescribed teams
Journal of Automata, Languages and Combinatorics
| Hi-index | 0.00 |
In each derivation step of a simple eco-grammar system with prescribed teams of ter Beek [2], at most one production of every agent of a team is used. In this paper, we soften this restriction imposed upon the agents. Each agent may use a greater, but limited number of productions in every step. We consider two different kinds of such limited eco-grammar systems with prescribed teams where the corresponding actions of the agents are motivated by the limitations of k-limited [9] or uniformly k-limited [10, 14] OL systems, respectively. By this mean, the generative power of the systems is changed. The corresponding language families are compared with each other according to the different types of the underlying L systems (OL, TOL, etc.), according to the different limitations of the underlying (uniformly) k-limited OL systems, and they are also compared with the language families given by OL or (uniformly) k-limited OL systems.