In this paper we investigate simple eco-grammar systems with dynamically formed teams of agents. Three natural conditions for constituting a team, based on the agents' current capability of activation, are considered. We study the relations of language classes of these simple eco-grammar systems to each other and to some other well-known classes of languages. Moreover, we prove that any recursively enumerable language can be obtained as the intersection of a regular language and the language of a simple eco-grammar system where the acting teams of agents are formed according to two of the above conditions.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In this paper we discuss some relationships between cooperating distributed (CD) grammar systems and the basic process algebra (BPA) calculus. We associate different types of process graphs from this calculus to CD grammar systems which describe the behavior of the components of the system under cooperation. We prove that these process graphs form a subalgebra of the graph model of BPA. It is also shown that for certain restricted variants of CD grammar systems and for certain types of these process graphs the bisimilarity of two process graphs is decidable.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.