Further Results on the Power of Generating APCol Systems

In this paper we continue our investigations in APCol systems (Automatonlike P colonies), variants of P colonies where the environment of the agents is given by a string and the functioning of the system resembles to the functioning of standard nite automaton. We rst deal with the concept of determinism in these systems and compare deterministic APCol systems with deterministic register machines. Then we focus on generating non-deterministic APCol systems with only one agent. We show that these systems are as powerful as 0-type grammars, i.e., generate any recursively enumerable language. If the APCol system is non-erasing, then any context-sensitive language can be generated by a non-deterministic APCol systems with only one agent

Automaton-like P Colonies

In this paper we study P colonies where the environment is given as a string. These variants, called automaton-like P systems or APCol systems, behave like automata: during functioning, the agents change their own states and process the symbols of the string. We develop the concept of APCol systems by introducing the notion of their generating working mode. We then compare the power of APCol systems working in the generating mode and that of register machines and context-free matrix grammars with and without appearance checking

Generalized P Colony Automata and Their Relation to P Automata

We investigate genPCol automata with input mappings that can be realized through the application of finite transducers to the string representations of multisets. We show that using unrestricted programs, these automata characterize the class of recursively enumerable languages. The same holds for systems with all-tape programs, having capacity at least two. In the case of systems with com-tape programs, we show that they characterize language classes which are closely related to those characterized by variants of P automata

A Note on Emergence in Multi-Agent String Processing Systems

We propose a way to define (and, in a certain extent, even to measure) the phenomenon of emergence which appears in a complex system of interacting agents whose global behaviour can be described by a language and whose components (agents) can also be associated with grammars and languages. The basic idea is to identify the "linear composition of behaviours" with "closure under basic operations", such as the AFL (Abstract Families of Languages) operations, which are standard in the theory of formal languages