Scholarlink

<p>This work presents a new class of reaction automata, called <i>Chemical Pure Reaction Automata</i> (CPRA). CPRA combines characteristics of chemical reaction automata, as introduced by Okubo et al. in 2016, with those of the more recently defined pure reaction automata. Unlike standard chemical reaction automata, CPRA lack permanence, meaning their result states consist solely of the reaction products, with unconsumed reactants being discarded. We investigate the computational power of two CPRA variants, both working in a maximally parallel manner. We first prove that <i>deterministic</i> CPRA (DCPRA)—in which at every state, for each input symbol, the resulting state is the same for all multisets of enabled reactions—are not Turing complete. We then show that non-deterministic CPRA are Turing complete and thus strictly more powerful than DCPRA: namely, the set of languages accepted by CPRA in the maximally parallel manner contains the set of languages accepted by standard chemical reaction automata in the same manner.</p>

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

Chemical pure reaction automata in maximally parallel manner

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年1月22日

查看全文
  • Rocco Ascone,
  • Giulia Bernardini,
  • Francesco Leiter,
  • Luca Manzoni

摘要

This work presents a new class of reaction automata, called Chemical Pure Reaction Automata (CPRA). CPRA combines characteristics of chemical reaction automata, as introduced by Okubo et al. in 2016, with those of the more recently defined pure reaction automata. Unlike standard chemical reaction automata, CPRA lack permanence, meaning their result states consist solely of the reaction products, with unconsumed reactants being discarded. We investigate the computational power of two CPRA variants, both working in a maximally parallel manner. We first prove that deterministic CPRA (DCPRA)—in which at every state, for each input symbol, the resulting state is the same for all multisets of enabled reactions—are not Turing complete. We then show that non-deterministic CPRA are Turing complete and thus strictly more powerful than DCPRA: namely, the set of languages accepted by CPRA in the maximally parallel manner contains the set of languages accepted by standard chemical reaction automata in the same manner.