Elsevier, Theoretical Computer Science, 26(410), p. 2478-2488, 2009
DOI: 10.1016/j.tcs.2008.12.055
Full text: Download
In this paper, we investigate the languages generated by asynchronous spiking neural P systems. Characterizations of finite languages and recursively enumerable languages are obtained by asynchronous spiking neural P systems with extended rules. The relationships of the languages generated by asynchronous spiking neural P systems with regular and non-semilinear languages are also investigated.