BWMC2005. Brainstorming Week On Membrane Computing (3rd. 2005. Sevilla)
http://hdl.handle.net/11441/34351
2017-11-19T08:28:33ZOn a Class of P Automata as a Machine Model for Languages over Infinite Alphabets
http://hdl.handle.net/11441/36867
On a Class of P Automata as a Machine Model for Languages over Infinite Alphabets
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 by different types of P automata
to some of the existing characterizations of language classes over infinite alphabets, and
give an upper bound for the class of languages accepted by the class of one of the most
straightforward and least complicated variants of these types of P automata.
2005-01-01T00:00:00ZRecognizing Membrane Structures with Tree Automata
http://hdl.handle.net/11441/36865
Recognizing Membrane Structures with Tree Automata
In this work we propose a new model of tree automata based on multisets
of states and symbols linked to the finite control. This new model accepts a set of trees
with symmetries between their internal nodes. We name this property as mirroring. We
propose an application of these automata to solve a problem related to P systems such
as recognizing identic membrane structures.
2005-01-01T00:00:00ZFurther Results on P Systems with Promoters/Inhibitors
http://hdl.handle.net/11441/36863
Further Results on P Systems with Promoters/Inhibitors
The paper gives several results regarding P systems with non-cooperative
rules and promoters/inhibitors at the level of rules. For the class of P systems using
inhibitors, generating families of sets of vectors of numbers, the equivalence with the
family of Parikh sets of ET0L languages is presented. In case of P systems with non-
cooperative promoted rules even if an upper bound was not given, the inclusion of the
family PsET0L was proved. Moreover, a characterization of such systems by means of
a particular form of random context grammars, therefore a sequential formal device, is
proposed.
2005-01-01T00:00:00ZDynamical Probabilistic P Systems: Definitions and Applications
http://hdl.handle.net/11441/36861
Dynamical Probabilistic P Systems: Definitions and Applications
We introduce dynamical probabilistic P systems, a variant where probabilities associated to the rules change during the evolution of the system, as a new approach
to the analysis and simulation of the behavior of complex systems. We define the notions
for the analysis of the dynamics and we show some applications for the investigation of the
properties of the Brusselator (a simple scheme for the Belousov-Zabothinskii reaction),
the Lotka-Volterra system and the decay process.
2005-01-01T00:00:00Z