نتایج جستجو برای: p systems

تعداد نتایج: 2392891  

Journal: :The Journal of Logic and Algebraic Programming 2010

2012
Erzsébet Csuhaj-Varjú Marian Gheorghe Mike Stannett M. Stannett

1 Department of Algorithms and Their Applications Faculty of Informatics, Eötvös Loránd University, Pázmány Péter st. 1/c, Budapest, 1117, Hungary [email protected] 2 Department of Computer Science, The University of Sheffield Regent Court, 211 Portobello, Sheffield S1 4DP, United Kingdom {M.Stannett, M.Gheorghe}@dcs.shef.ac.uk 3 Department of Computer Science, University of Piteşti Str Targu ...

2009
Vincenzo Manca

Metabolic P systems (MP systems) represent metabolic processes in a discrete mathematical framework based on P systems. MP systems are presented, with a special emphasis to their roots and to their relationship with P systems, which provided the right conceptual framework for their development. A synthetic algebraic formulation of MP system is given, and the log-gain theory of MP systems is out...

2006
Artiom Alhazov Rudolf Freund Marion Oswald Marija Slavkovik

We consider extended variants of spiking neural P systems and show how these extensions of the original model allow for easy proofs of the computational completeness of extended spiking neural P systems and for the characterization of semilinear sets and regular languages by finite extended spiking neural P systems (defined by having only finite checking sets in the rules assigned to the cells)...

2002
Francesco Bernardini Vincenzo Manca

We propose a new variant of P Systems, based on boundary rules, shortly called PB Systems. Boundary rules means that rules are not internal to regions but they are able to “see” even externally, that is, they are sensible to what happens around the border of the membranes. We prove the computational universality for PB systems with three membranes which sense at most one symbol outside and one ...

2013
Ciprian Dragomir Florentin Ipate Savas Konur Raluca Lefticaru Laurentiu Mierla

Recent research in membrane computing examines and confirms the anticipated modelling potential of kernel P systems in several case studies. On the one hand, this computational model is destined to be an abstract archetype which advocates the unity and integrity of P systems onto a single formalism. On the other hand, this envisaged convergence is conceived at the expense of a vast set of primi...

2014
Linqiang Pan Gheorghe Păun

We further investigate the parallel array P systems recently introduced by K.G. Subramanian, P. Isawasan, I. Venkat, and L. Pan. We first make explicit several classes of parallel array P systems (with one or more axioms, with total or maximal parallelism, with rules of various types). In this context, some results from the above mentioned paper by Subramanian et al. are improved. A series of o...

Journal: :Fundam. Inform. 2008
Erzsébet Csuhaj-Varjú Antonio di Nola Gheorghe Paun Mario J. Pérez-Jiménez György Vaszil

1 Computer and Automation Institute Hungarian Academy of Sciences Kende utca 13–17, H-1111 Budapest, Hungary E-mail: {csuhaj, vaszil}@sztaki.hu 2 Department of Mathematics and Computer Science University of Salerno 84081 Baronissi, Salerno, Italy E-mail: [email protected] 3 Institute of Mathematics of the Romanian Academy PO Box 1-764, 014700 Bucureşti, Romania E-mail: [email protected] 4 Rese...

Journal: :Electr. Notes Theor. Comput. Sci. 2003
Nicoletta Sabadini Robert F. C. Walters

In the context of a compositional theory of automata [8] (CP automata) we define a notion of hierarchical automaton, and show how the P-systems of Gh. Păun [9] may be described in terms of these automata. A distributive law for CP automata is proved which relates two different views of hierarchical systems: the first view is that hierarchical systems consist of layers, with communication betwee...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید