Buscar
Mostrando ítems 1-10 de 10
Ponencia
Simulating Membrane Systems and Dissolution in a Typed Chemical Calculus
(Fénix Editora, 2015)
We present a transformation of membrane systems, possibly with pro- moter/inhibitor rules, priority relations, and membrane dissolution, into formulas of the chemical calculus such that terminating computations of membranes ...
Ponencia
Describing Membrane Computations with a Chemical Calculus
(Fénix Editora, 2014)
Membrane systems are nature motivated computational models inspired by certain basic features of biological cells and their membranes. They are examples of the chemical computational paradigm which describes computation ...
Ponencia
The DBSCAN Clustering Algorithm on P Systems
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
We show how to implement the DBSCAN clustering algorithm (Density Based Spatial Clustering of Applications with Noise) on membrane systems using evolution rules with promoters and priorities.
Ponencia
Membrane Systems with Priority, Dissolution, Promoters and Inhibitors and Time Petri Nets
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
We continue the investigations on exploring the connection between membrane systems and time Petri nets already commenced in [4] by extending membrane systems with promoters/inhibitors, membrane dissolution and priority ...
Ponencia
Membrane Systems and Time Petri Nets
(Fenix Editora, 2017)
We investigate the relationship of time Petri nets and di erent variants of membrane systems. First we show that the added feature of \time" in time Petri nets makes it possible to simulate the maximal parallel rule ...
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 ...
Ponencia
On the Classes of Languages Characterized by Generalized P Colony Automata
(Fénix, 2016)
We study the computational power of generalized P colony automata and show how it is in uenced by the capacity of the system (the number of objects inside the cells of the colony) and the types of programs which are ...