ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS-Reference-Cited by-同舟云学术

ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS

Published:2011-01 Issue:01 Volume:22 Page:75-88
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

SOSÍK PETR¹²,RODRÍGUEZ-PATÓN ALFONSO¹,CIENCIALA LUDĚK²

Affiliation:

1. Departamento de Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo s/n, Boadilla del Monte, 28660 Madrid, Spain

2. Institute of Computer Science, Faculty of Philosophy and Science, Silesian University in Opava, 74601 Opava, Czech Republic

Abstract

The paper summarizes recent knowledge about computational power of spiking neural P systems and presents a sequence of new more general results. The concepts of recognizer SN P systems and of uniform families of SN P systems provide a formal framework for this study. We establish the relation of computational power of spiking neural P systems with various limitations to standard complexity classes like P , NP, PSPACE and P /poly.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054111007848

Reference12 articles.

1. A new algorithm for regularizing one-letter context-free grammars

2. A universal interconnection pattern for parallel computers

3. Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources

4. Uniform solutions to SAT and Subset Sum by spiking neural P systems

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Spiking Neural P Systems with Rules on Synapses Working in Sum Spikes Consumption Strategy;Fundamenta Informaticae;2017-10-31

2. POLYNOMIAL TIME-BOUNDED COMPUTATIONS IN SPIKING NEURAL P SYSTEMS;Neural Network World;2013