In this paper we extend the conditions of dynamic team constitution in simple eco– grammar systems, motivated by the bottom–up–clustering algorithm. The relationships of simple eco–grammar systems formed according to the newly introduced conditions to each other as well as to certain language classes of the Chomsky hierarchy and L systems are established. We prove that any recursively enumerable language can be ob-tained as the intersection of a regular language and the language of simple eco–grammar systems where the active teams are organized according to different conditions of team constitution. We also propose some further research directions
. The concept of cooperation and distribution as known from the area of grammar systems is introduce...
In this note we define a machine that generates nests. The basic relations commonly attributed to li...
In this paper we make a comparison between two methods for the enumeration of combinato-rial objects...
Grammar systems are abstract models of computation invented to formalize the agents systems of Artif...
AbstractIn this paper, we investigate simple eco-grammar systems with n agents. The number of agents...
summary:Positioned eco-grammar systems (PEG systems, for short) were introduced in our previous pape...
We investigate the generative capacity of the so-called conditional tabled eco-grammar systems (CTEG...
Abs t r ac t. In this paper, we introduce a dynamical complexity measure, namely the degree of team ...
Two powerful variants of simple eco-grammax systems, namely extended tabled simple eco-grammar syste...
Abstract A formal framework for studying systems made up of a community of agents and their environm...
summary:In this paper we follow our previous research in the field of positioned agents in the eco-g...
We prove that grammar systems with (prescribed or free) teams (of constant size at least two or arbi...
Eco-grammar systems and artificial neural networks have many common features: massive parallelism, i...
This article defines cooperating distributed grammar systems with E0L components instead of context-...
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if...
. The concept of cooperation and distribution as known from the area of grammar systems is introduce...
In this note we define a machine that generates nests. The basic relations commonly attributed to li...
In this paper we make a comparison between two methods for the enumeration of combinato-rial objects...
Grammar systems are abstract models of computation invented to formalize the agents systems of Artif...
AbstractIn this paper, we investigate simple eco-grammar systems with n agents. The number of agents...
summary:Positioned eco-grammar systems (PEG systems, for short) were introduced in our previous pape...
We investigate the generative capacity of the so-called conditional tabled eco-grammar systems (CTEG...
Abs t r ac t. In this paper, we introduce a dynamical complexity measure, namely the degree of team ...
Two powerful variants of simple eco-grammax systems, namely extended tabled simple eco-grammar syste...
Abstract A formal framework for studying systems made up of a community of agents and their environm...
summary:In this paper we follow our previous research in the field of positioned agents in the eco-g...
We prove that grammar systems with (prescribed or free) teams (of constant size at least two or arbi...
Eco-grammar systems and artificial neural networks have many common features: massive parallelism, i...
This article defines cooperating distributed grammar systems with E0L components instead of context-...
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if...
. The concept of cooperation and distribution as known from the area of grammar systems is introduce...
In this note we define a machine that generates nests. The basic relations commonly attributed to li...
In this paper we make a comparison between two methods for the enumeration of combinato-rial objects...