@article {755,
	title = {Spiking Neural dP Systems},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {193-208},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	url = {http://www.gcn.us.es/9BWMC/volume/12multiAlfonso.pdf},
	author = {Mihai Ionescu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori}
}
@article {807,
	title = {Spiking Neural dP Systems},
	journal = {Fundamenta Informaticae},
	volume = {11},
	year = {2011},
	pages = {423-436},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	issn = {0169-2968},
	doi = {10.3233/FI-2011-544},
	url = {http://www.gcn.us.es/9bwmc_proceedings},
	author = {Mihai Ionescu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori}
}
@article {495,
	title = {On spiking neural P systems},
	journal = {Natural Computing},
	volume = {9},
	year = {2010},
	month = {06/2010},
	pages = {475-491},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an SN P system is presented. The analysis of the diagram cycles codifies invariants formulae which enable us to establish the soundness and completeness of the system with respect to the problem it tries to resolve. We also study the universality of asynchronous and sequential SN P systems and the capability these models have to generate certain classes of languages. Further, by making a slight modification to the standard SN P systems, we introduce a new variant of SN P systems with a special I/O mode, called SN P modules, and study their computing power. It is demonstrated that, as string language acceptors and transducers, SN P modules can simulate several types of computing devices such as finite automata, a-finite transducers, and systolic trellis automata.},
	keywords = {Asynchronous, Finite automaton, Finite state transducer, Formal Verification, Sequential, Spiking neural P system, Systolic trellis automaton, Universality},
	issn = {1567-7818},
	doi = {10.1007/s11047-009-9159-3},
	url = {http://www.springerlink.com/content/krhu646461138370/},
	author = {Oscar Ibarra and Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori}
}
@article {489,
	title = {Membrane Computing schema: A new approach to computation using string insertion},
	journal = {Algorithmic Bioprocesses},
	volume = {V},
	year = {2009},
	note = {A. Condon, D. Harel, J.N. Kon, A. Salomaa, E. Winfree (eds)},
	pages = {293-309},
	publisher = {Springer-Verlag},
	abstract = {In this paper, we introduce the notion of a membrane computing schema for string objects. We propose a computing schema for a membrane network (i.e., tissue-like membrane system) where each membrane performs unique type of operations at a time and sends the result to others connected through the channel. The distinguished features of the computing models obtained from the schema are:
1.  	only context-free insertion operations are used for string generation,
2.  	some membranes assume filtering functions for structured objects (molecules),
3.  	generating model and accepting model are obtained in the same schema, and both are computationally universal,
4.  	several known rewriting systems with universal computability can be reformulated by the membrane computing schema in a uniform manner.
The first feature provides the model with a simple uniform structure which facilitates a biological implementation of the model, while the second feature suggests further feasibility of the model in terms of DNA complementarity.
Through the third and fourth features, one may have a unified view of a variety of existing rewriting systems with Turing computability in the framework of membrane computing paradigm.
},
	isbn = {978-3-540-88868-0},
	issn = {1619-7127},
	doi = {10.1007/978-3-540-88869-7},
	url = {http://www.springerlink.com/content/p3205203u433797g/},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori},
	editor = {A. Condon and D. Harel and J. N. Kon and Arto Salomaa and Eric Winfree}
}
@article {358,
	title = {Representations and characterizations of languages in Chomsky hierarchy by means of insertion-deletion systems},
	journal = {International Journal of Foundations of Computer Science},
	volume = {19},
	year = {2008},
	month = {08/2008},
	pages = {859-871},
	publisher = {World Scientific},
	address = {London, U.K.},
	abstract = {	Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability and characterizations or representations of languages in Chomsky hierarchy were obtained in this framework.

In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of as small as possible complexity. For instance, each recursively enumerable language L can be represented in a way similar to the celebrated Chomsky-Sch{\"u}tzenberger representation of context-free languages, i.e., in the form L = h(L(γ) ∩ D), where γ is an insertion system of weight (3, 0) (at most three symbols are inserted in a context of length zero), h is a projection, and D is a Dyck language. A similar representation can be obtained for regular languages, involving insertion systemsof weight (2,0) and star languages, as well as for context-free languages {\textendash} this time using insertion systems of weight (3, 0) and star languages.},
	keywords = {Insertion-deletion systems; Recursively enumerable languages; Context-free languages; Regular languages; 68Q42 (AMSC); 68Q45 (AMSC); 68Q50 (AMSC)},
	issn = {0129-0541},
	doi = {10.1142/S0129054108006005},
	url = {http://dx.doi.org/10.1142/S0129054108006005},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori}
}
@article {585,
	title = {Spiking neural P systems with an exhaustive use of rules},
	journal = {International Journal of Unconventional Computing},
	volume = {3},
	year = {2007},
	pages = {135-153},
	publisher = {Old City Publishing Inc.},
	address = {Philadelphia, USA},
	abstract = {We consider spiking neural P systems with a new type of rule application: whenever a rule is enabled in a neuron, it is used in an exhaustive manner, i.e., as many times as possible for the number of spikes from that neuron. Thus, also the number of spikes produced at a time in that neuron can be arbitrarily large; all produced spikes are transmitted to neighboring neurons through synapses. A result is associated with a computation as usual, in the form of the number of time units elapsed between the first two steps when the output neuron
spikes. In this framework, we prove the computational completeness of our systems, both as number generating devices and as number accepting devices. Several research topics are also pointed out.},
	issn = {1548-7199},
	url = {http://direct.bl.uk/bld/PlaceOrder.do?UIN=210412711\&ETOC=RN\&from=searchengine},
	author = {Mihai Ionescu and Gheorghe Paun and Takashi Yokomori}
}
@article {,
	title = {Spiking Neural P Systems},
	journal = {Fundamenta Informaticae},
	volume = {71},
	year = {2006},
	pages = {279-308},
	address = {Amsterdam, Holanda},
	url = {http://psystems.disco.unimib.it/download/spikingf.pdf},
	attachments = {http://www.gcn.us.es/biblio/author/files/files/Spiking neural p systems.pdf},
	author = {Mihai Ionescu and Gheorghe Paun and Takashi Yokomori}
}
@article {,
	title = {On the power of membrane division in P systems},
	journal = {Theoretical Computer Science},
	volume = {324},
	year = {2004},
	pages = {61 - 85},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {First, we consider P systems with active membranes, hence with the possibility that the membranes can be divided, with non-cooperating evolution rules (the objects always evolve separately). These systems are known to be able to solve NP-complete problems in linear time. Here we give a normal form theorem for such systems: their computational universality is preserved even if only the elementary membranes are divided. The possibility of solving SAT in linear time is preserved only when non-elementary membranes may also be divided under the influence of objects in their region.Second, we consider a slight generalization, namely, we allow that a membrane can produce by division both a copy of itself and a copy of a membrane with a different label; again, only elementary membranes may be divided. In this case, we prove that the hierarchy on the maximal number of membranes present in the system collapses: three membranes at a time are sufficient in order to characterize the recursively enumerable sets of vectors of natural numbers. This result is optimal, two membranes are shown not to be sufficient.Third, we consider P systems with cooperating rules (several objects may evolve together). Making use of this powerful feature, we show that many NP-complete problems can be solved in linear time in a quite uniform way (by systems which are very similar to each other), using only elementary membranes division (and not further ingredients, such as electrical charges). The degree of cooperation is minimal: two objects at a time. 


},
	keywords = {Membrane computing, recursively enumerable language, SAT problem, Universality},
	issn = {0304-3975},
	doi = {10.1016/j.tcs.2004.03.053},
	url = {http://portal.acm.org/citation.cfm?id=1041011},
	author = {Gheorghe Paun and Yasuhiro Suzuki and Hiroshi Tanaka and Takashi Yokomori}
}
@article {,
	title = {P systems on graphs of restricted forms},
	journal = {Publicationes Mathematicae Debrecen},
	volume = {60},
	year = {2002},
	pages = {635-660},
	address = {Debrecen, Hungr{\'\i}a},
	issn = {0033-3883},
	author = {Gheorghe Paun and Y. Sakakibara and Takashi Yokomori}
}
