Buscar
Mostrando ítems 1-9 de 9
Ponencia
Red-Green P Automata
(Fénix Editora, 2014)
In this short note we extend the notion of red-green Turing machines to speci c variants of P automata. Acceptance and recognizability of nite strings by red- green automata are de ned via in nite runs of the automaton ...
Ponencia
P Colonies and Reaction Systems
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020)
P colonies are abstract computing devices modeling communities of very simple reactive agents living and acting in a joint shared environment which is given with a multiset of objects. Reaction systems were proposed as ...
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
Automaton-like P Colonies
(Fénix Editora, 2015)
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 ...
Ponencia
Towards P Colonies Processing Strings
(Fénix Editora, 2014)
In this paper we introduce and study P colonies where the environment is given as a string. These variants of P colonies, called Automaton-like P systems or APCol systems, behave like automata: during functioning, the ...
Ponencia
General Topologies and P Systems
(Fénix Editora, 2012)
In this paper we investigate the use of general topological spaces as control mechanisms for membrane systems. For simplicity, we illustrate our approach by showing how arbitrary topologies can be used to study the ...
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 ...