关于一元P系统的膜数
On the Number of Membranes in Unary P Systems
摘要:
我们认为P系统的线性膜结构的工作对象在一元字母表使用类似同态的规则集。P系统的这种受限变体允许生成的一元语言的唯一最小表示,并且以这种方式有效地解决等价问题。此外,我们还研究了一元P系统相对于膜数的函数复杂性。
英文摘要:
We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems allows for a unique minimal representation of the generated unary language and in that way for an effective solution of the equivalence problem. Moreover, we examine the descriptional complexity of unary P systems with respect to the number of membranes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。