Add to ORKGWe introduce the concept of a P colony automaton, an automata-like con- struct combining properties of finite automata and P colonies. We present some preliminary results on the accepting power of several variants of these extremely simple language recognizing devices, and propose problems for future research
In this paper a subclass of generalized P colony automata is defined that satisfies a property which...
We study two very simple variants of P colonies: systems with only one object inside the cells, and ...
We study two variants of P colonies with initial content of P colony and so called passive environm...
In this paper we introduce and study P colonies where the environment is given as a string. These v...
In this paper we study P colonies where the environment is given as a string. These variants, calle...
We study the computational power of generalized P colony automata and show how it is in uenced by ...
The P colonies were introduced in as a variant of the bio-inspired com- putational models called me...
We investigate the possibility of the deterministic parsing (that is, parsing without backtracking)...
We investigate genPCol automata with input mappings that can be realized through the application of ...
We introduce a new acceptance mode for APCol systems (Automaton-like P colonies), variants of P col...
We study the computational power of generalized P colony automata and show how it is influenced by t...
We continue the investigation of P colonies introduced in, a class of abstract computing devices co...
We continue here the investigation of P automata, in their non-extended case, a class of devices wh...
We show how P automata having a finite description and working with a finite object-alphabet can be...
AbstractWe continue here the investigation of P automata, in their non-extended case, a class of dev...
In this paper a subclass of generalized P colony automata is defined that satisfies a property which...
We study two very simple variants of P colonies: systems with only one object inside the cells, and ...
We study two variants of P colonies with initial content of P colony and so called passive environm...
In this paper we introduce and study P colonies where the environment is given as a string. These v...
In this paper we study P colonies where the environment is given as a string. These variants, calle...
We study the computational power of generalized P colony automata and show how it is in uenced by ...
The P colonies were introduced in as a variant of the bio-inspired com- putational models called me...
We investigate the possibility of the deterministic parsing (that is, parsing without backtracking)...
We investigate genPCol automata with input mappings that can be realized through the application of ...
We introduce a new acceptance mode for APCol systems (Automaton-like P colonies), variants of P col...
We study the computational power of generalized P colony automata and show how it is influenced by t...
We continue the investigation of P colonies introduced in, a class of abstract computing devices co...
We continue here the investigation of P automata, in their non-extended case, a class of devices wh...
We show how P automata having a finite description and working with a finite object-alphabet can be...
AbstractWe continue here the investigation of P automata, in their non-extended case, a class of dev...
In this paper a subclass of generalized P colony automata is defined that satisfies a property which...
We study two very simple variants of P colonies: systems with only one object inside the cells, and ...
We study two variants of P colonies with initial content of P colony and so called passive environm...