Buscar
Mostrando ítems 1-10 de 15
Ponencia
A Class of P Automata for Characterizing Context-free Languages
(Fénix Editora, 2006)
We present a characterization of context-free languages in terms of a restricted class of P automata (P systems accepting strings of symbols using symport/antiport communication rules). The characterization is based on the ...
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
On a Class of P Automata as a Machine Model for Languages over Infinite Alphabets
(Fénix Editora, 2005)
We show how P automata having a finite description and working with a finite object-alphabet can be used to describe languages over countably infinite alphabets. We propose to relate the language classes characterized ...
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
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
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
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 ...