Rewriting P Systems with Flat-Splicing Rules

详细信息    查看全文

• 关键词：Bio ; inspired computing ; Membrane computing ; P system ; Flat splicing ; Chomsky hierarchy
• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10105
• 期：1
• 页码：340-351
• 丛书名：Membrane Computing
• ISBN：978-3-319-54072-6
• 卷排序：10105

文摘

Rewriting P systems, as language generating devices, are one of the earliest classes of P systems with structured strings as objects and the rewriting rules as evolution rules. Flat splicing is an operation on strings, inspired by a splicing operation on circular strings. In this work, we consider a variant of rewriting P systems with only regular or linear rewriting rules and alphabetic flat splicing rules, and the language generative power of rewriting P systems with flat splicing rules in comparison with flat splicing systems and Chomsky hierarchy is investigated.