On string languages generated by spiking neural P systems with exhaustive use of rules |
| |
| Authors: | Xingyi Zhang Xiangxiang Zeng Linqiang Pan |
| |
| Affiliation: | (1) Key Laboratory of Image Processing and Intelligent Control, Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan, 430074, Hubei, China |
| |
| Abstract: | ![]()
We continue the study of (extended) spiking neural P systems with exhaustive use of rules by considering these computing devices as language generators. Specifically, a step is associated with a symbol according to the number of spikes emitted by the output neuron and the sequence of these symbols associated with a halting computation constitutes a string. Two cases are considered: one of them interprets a step when no spike is emitted as a specified symbol, the other interprets such a step as the empty string. In both cases, it is proved that finite and recursively enumerable languages are characterized by extended spiking neural P systems working in the exhaustive mode. The relationships with regular languages are also investigated. |
| |
| Keywords: | Membrane computing Register machine SN P systems |
| 本文献已被 SpringerLink 等数据库收录！ |
|
