Work

On String Languages Generated by Spiking Neural P Systems

Year: 2007

Type: article

Abstract: Summary. We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computa-tions of a given system constitutes the language generated by that system. Although the work of spiking neural P systems is rather restricted (and this is illustrated by the fact that very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems. 1

Authors: Haiming Chen, Rudolf Freund, Mihai Ionescu, Gheorghe Păun, Mario J. Pérez–Jiménez

Institutions: Chinese Academy of Sciences, Institute of Software, TU Wien, Universitat Rovira i Virgili, IMAR - Institutul de Matematică „Simion Stoilow” al Academiei Române, Romanian Academy, Universidad de Sevilla

Language: English

Topic: DNA and Biological Computing

Subfield: Theoretical Computer Science

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2125285012

FWCI: 8.541

Cites: 19

Cited by: 163

Related to: 10