%0 Generic
%D 2006
%T Bounding the indegree of Spiking Neural P systems
%A Gheorghe Paun
%A Mario J. Pérez-Jiménez
%A Arto Salomaa
%C Turku, Finlandia
%K indegree of graph
%K Membrane computing
%K recursively enumerable
%K spike train
%K spiking neuron
%K synapses
%P 1-8
%U http://www.tucs.fi/publications/attachment.php?fname=TR773.pdf
%V 773
%X We continue the search of normal forms for spiking neural p systems, and we prove that the indegree of such systems (the maximal number of incoming synapses of neurons) can be bounded by 2 without losing the computational completeness.