Paper Info
Title
Extended spiking neural p systems
Abstract
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) with only a bounded number of neurons.
Year
DOI
Venue
2006
10.1007/11963516_8
Workshop on Membrane Computing
Keywords
Field
DocType
computational completeness,extended variant,bounded number,finite extended spiking neural,extended spiking neural p,original model,finite checking set,neural p system,p system,easy proof,regular language
Discrete mathematics,Mathematical proof,Regular language,Register machine,Membrane computing,Completeness (statistics),Mathematics,Bounded function
Conference
Volume
ISSN
ISBN
4361
0302-9743
3-540-69088-3
Citations 
PageRank 
References 
13
0.74
10
Authors
4
Name
Order
Citations
PageRank
Artiom Alhazov164268.17
Rudolf Freund21000109.64
Marion Oswald332030.27
Marija Slavkovik412522.60