On String Languages Generated by Spiking Neural P Systems with Astrocytes

IF 0.4 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING Fundamenta Informaticae Pub Date : 2015-07-01 DOI:10.3233/FI-2015-1154
Yuan Kong, Zheng Zhang, Yang Liu
{"title":"On String Languages Generated by Spiking Neural P Systems with Astrocytes","authors":"Yuan Kong, Zheng Zhang, Yang Liu","doi":"10.3233/FI-2015-1154","DOIUrl":null,"url":null,"abstract":"Spiking neural P systems with astrocytes (SNPA systems, for short) are a class of distributed parallel computing devices inspired from the way spikes pass along the synapses between neurons. In this work, we investigate the computational power of SNPA systems as language generators. Specifically, representations of recursively enumerable languages and of regular languages are given by means of SNPA systems without forgetting rules. Furthermore, a simple finite language is produced which can be generated by SNPA systems, while it cannot be generated by usual spiking neural P systems. These results show that the astrocytes are a powerful ingredient for spiking neural P systems as language generators.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"20 1","pages":"225-229"},"PeriodicalIF":0.4000,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fundamenta Informaticae","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3233/FI-2015-1154","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 2

Abstract

Spiking neural P systems with astrocytes (SNPA systems, for short) are a class of distributed parallel computing devices inspired from the way spikes pass along the synapses between neurons. In this work, we investigate the computational power of SNPA systems as language generators. Specifically, representations of recursively enumerable languages and of regular languages are given by means of SNPA systems without forgetting rules. Furthermore, a simple finite language is produced which can be generated by SNPA systems, while it cannot be generated by usual spiking neural P systems. These results show that the astrocytes are a powerful ingredient for spiking neural P systems as language generators.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
星形胶质细胞脉冲神经系统生成的字符串语言
带有星形胶质细胞的脉冲神经系统(简称SNPA系统)是一类分布式并行计算设备,其灵感来自于脉冲沿着神经元之间的突触传递的方式。在这项工作中,我们研究了SNPA系统作为语言生成器的计算能力。具体地说,递归可枚举语言和正则语言的表示是通过SNPA系统在不忘记规则的情况下给出的。此外,还得到了一种简单的有限语言,该语言可以由SNPA系统生成,而通常的脉冲神经系统不能生成。这些结果表明星形胶质细胞是作为语言生成器的脉冲神经系统的强大成分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Fundamenta Informaticae
Fundamenta Informaticae 工程技术-计算机:软件工程
CiteScore
2.00
自引率
0.00%
发文量
61
审稿时长
9.8 months
期刊介绍: Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing: solutions by mathematical methods of problems emerging in computer science solutions of mathematical problems inspired by computer science. Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, algebraic and categorical methods.
期刊最新文献
Diameter of General Knödel Graphs String Covering: A Survey Computing Square Roots in Quaternion Algebras Methods for Efficient Unfolding of Colored Petri Nets On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1