Characterizing regular languages by spiking neural P systems

被引：8

作者：

Ibarra, Oscar H. ^{[1
]}

Woodworth, Sara ^{[1
]}

机构：

[1] Univ Calif Santa Barbara, Dept Comp Sci, Santa Barbara, CA 93106 USA

来源：

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2007年 / 18卷 / 06期

关键词：

spiking neural P system; bounded neuron; regular language;

D O I：

10.1142/S0129054107005297

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We look at spiking neural P systems (SN P systems, for short) all of whose neurons are bounded. We show that a language L subset of (0 + 1)* is regular if and only if 1L (i. e., with a supplementary prefix of 1) is generated by a bounded SN P system. This result does not hold when the prefix is replaced by a suffix. For example, 0* 1 cannot be generated by a bounded SN P system.

引用

页码：1247 / 1256

页数：10