Buscar
Mostrando ítems 1-7 de 7
Ponencia
On Very Simple P Colonies
(Fénix Editora, 2009)
We study two very simple variants of P colonies: systems with only one object inside the cells, and systems with insertion-deletion programs, so called P colonies with senders and consumers. We show that both of these ...
Ponencia
Small Computationally Complete Symport/Antiport P Systems
(Fénix Editora, 2006)
It is known that P systems with symport/antiport rules simulate the register machines, i.e., they are computationally complete. Hence, due to the existence of universal register machines, there exist computationally ...
Ponencia
Editing Configurations of P Systems
(Fénix Editora, 2005)
This paper proposes and preliminarily investigates the possibility of transforming a configuration (membrane structure and multisets of symbol-objects present in the compartments of this membrane structure) of a P system ...
Ponencia
PCol Automata: Recognizing Strings with P Colonies
(Fénix Editora, 2010)
We 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 ...
Ponencia
P Systems for Social Networks
(Fénix Editora, 2011)
We introduce some variants of P systems that mimic the behaviour of social networks and illustrate some of the characteristics of them. Other concepts related to social networks are discussed and suitable classes of P ...
Ponencia
A Note on a New Class of APCol Systems
(Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
We introduce a new acceptance mode for APCol systems (Automaton-like P colonies), variants of P colonies where the environment of the agents is given by a string and during functioning the agents change their own states ...
Ponencia
P Colony Automata with LL(k)-like Conditions
(Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages characterized by (generalized) P colony automata. We de ne a class of P colony automata satisfying a property ...