Scholarlink

<p>In this paper we investigate three classes of alphabetic flat splicing systems, namely cell, tissue, and Eilenberg P systems, by considering slightly modified splicing operations for the same systems. The modification in flat splicing is based on the insertion operation. The computational power of these new models is investigated with respect to complexity measures, such as the number of membranes, for all of them, and the number of states for Eilenberg P systems. Some more general results are reported in this paper. Applications on generating chain code picture languages with these newly modified formalisms are also presented.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Three classes of modified alphabetic flat splicing P systems

  • 期刊论文

  • 发表日期：

    2025年4月21日

查看全文
  • Rodica Ceterchi,
  • Marian Gheorghe,
  • Lakshmanan Kuppusamy,
  • K. G. Subramanian

摘要

In this paper we investigate three classes of alphabetic flat splicing systems, namely cell, tissue, and Eilenberg P systems, by considering slightly modified splicing operations for the same systems. The modification in flat splicing is based on the insertion operation. The computational power of these new models is investigated with respect to complexity measures, such as the number of membranes, for all of them, and the number of states for Eilenberg P systems. Some more general results are reported in this paper. Applications on generating chain code picture languages with these newly modified formalisms are also presented.