#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2004

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

In this paper we define a general class of P systems covering some biological operations with membranes, including evolution, communication, modifying the membrane structure, and we describe and formally specify some of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules… (More)

- Tseren-Onolt Ishdorj, Alberto Leporati, Linqiang Pan, Xiangxiang Zeng, Xingyi Zhang
- Theor. Comput. Sci.
- 2010

1 Computational Biomodelling Laboratory Department of Information Technologies Åbo Akademi University, Turku 20520, Finland tishdorj@abo.fi 2 Dipartimento di Informatica, Sistemistica e Comunicazione Università degli Studi di Milano – Bicocca Viale Sarca 336/14, 20126 Milano, Italy alberto.leporati@unimib.it 3 Key Laboratory of Image Processing and… (More)

- Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj, Andrei Paun, Gheorghe Paun, Mario J. Pérez-Jiménez
- Natural Computing
- 2006

We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous results from these areas are briefly recalled. Then, the computing power of the obtained systems is investigated, when considering them as… (More)

- Tseren-Onolt Ishdorj, Alberto Leporati
- Natural Computing
- 2008

We consider the possibility of using spiking neural P systems for solving computationally hard problems, under the assumption that some (possibly exponentially large) pre-computed resources are given in advance. In particular, we propose two uniform families of spiking neural P systems which can be used to address the NP-complete problems sat and 3-sat,… (More)

- Linqiang Pan, Artiom Alhazov, Tseren-Onolt Ishdorj
- Soft Comput.
- 2005

The P systems are a class of distributed parallel computing devices of a biochemical type. In this note, we show that by using membrane separation to obtain exponential workspace, SAT problem can be solved in linear time in a uniform and confluent way by active P systems without polarizations. This improves some results already obtained by A. Alhazov, T.-O.… (More)

We consider a special form of spiking neural P systems, called axon P systems , corresponding to the activity of Ranvier nodes of neuron axon, and we briefly investigate the language generative power of these devices

- Tseren-Onolt Ishdorj, TESIS DOCTORAL, +14 authors Alvaro Romero
- 2007

4 Acknowledgments I am very proud of natural computing community, especially, of P-friends community, for their achievements and for the scientific framework in which I was privileged to work during elaborating this thesis. My heartfelt thanks to my supervisors Dr. Gheorghe P˘ aun and Prof. Dr. Mario de J. Pérez-Jiménez for their fundamental encouragement… (More)

- Linqiang Pan, Tseren-Onolt Ishdorj
- J. UCS
- 2004

The P systems are a class of distributed parallel computing devices of a biochemical type. In this paper, a new definition of separation rules in P systems with active membranes is given. Under the new definition, the efficiency and universality of P systems with active membranes and separation rules instead of division are investigated.

We consider spiking neural P systems with spiking rules allowed to introduce zero, one, or more spikes at the same time. The computing power of the obtained systems is investigated, when considering them as number generating and as language generating devices. In the first case, a simpler proof of universality is obtained (universality is already known for… (More)

We consider spiking neural P systems with spiking rules allowed to introduce zero, one, or more spikes at the same time. A tool-kit for computing (some) operations with languages generated by such systems is provided. Computing the union of languages is easy. However, computing the concatenation or the intersection with a regular language is not so easy. A… (More)