JUCS - Journal of Universal Computer Science 1(5): 252-268, doi: 10.3217/jucs-001-05-0252
Conditional Tabled Eco-Grammar Systems
Erzsebet Csuhaj-Varju‡, Gheorghe Paun§, Arto Salomaa|‡ Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest, Hungary§ Institute of Mathematics of the Romanian Academy, Bucharest, Romania| Academy of Finland and University of Turku, Department of Mathematics, Turku, Finland
Corresponding author: Erzsebet Csuhaj-Varju © Erzsebet Csuhaj-Varju, Gheorghe Paun, Arto Salomaa. This article is freely available under the J.UCS Open Content License. Citation:
Csuhaj-Varju E, Paun G, Salomaa A (1995) Conditional Tabled Eco-Grammar Systems. JUCS - Journal of Universal Computer Science 1(5): 252-268. https://doi.org/10.3217/jucs-001-05-0252 |  |
Abstract
We investigate the generative capacity of the so-called conditional tabled eco-grammar systems (CTEG). They are a variant of ecogrammar systems, generative mechanisms recently introduced as models of the interplay between environment and agents in eco-systems. In particular, we compare the power of CTEG systems with that of programmed and of random context T0L systems and with that of ET0L systems. CTEG systems with one agent only (and without extended symbols) are found to be surprisingly powerful (they can generate non-ET0L languages). Representation theorems for ET0L and for recursively enumerable languages in terms of CTEG languages are also presented. 1.) Research supported by the Academy of Finland, Project 11281
Keywords
Grammar systems, L systems, Artificial Life