On the rule complexity of universal tissue P systems
Y Rogozhin, S Verlan - … : 6th International Workshop, WMC 2005, Vienna …, 2006 - Springer
Membrane Computing: 6th International Workshop, WMC 2005, Vienna, Austria …, 2006•Springer
In the last time several attempts to decrease different complexity parameters (number of
membranes, size of rules, number of objects etc.) of universal P systems were done. In this
article we consider another parameter which was not investigated yet: the number of rules.
We show that 8 rules suffice to recognise any recursively enumerable language if splicing
tissue P systems are considered.
membranes, size of rules, number of objects etc.) of universal P systems were done. In this
article we consider another parameter which was not investigated yet: the number of rules.
We show that 8 rules suffice to recognise any recursively enumerable language if splicing
tissue P systems are considered.
Abstract
In the last time several attempts to decrease different complexity parameters (number of membranes, size of rules, number of objects etc.) of universal P systems were done. In this article we consider another parameter which was not investigated yet: the number of rules. We show that 8 rules suffice to recognise any recursively enumerable language if splicing tissue P systems are considered.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果