Scholarlink

<p>We investigate the relationship of languages characterized by variants of string assembling systems and by Watson-Crick finite automata with a small number of states. Besides the general variant, we consider so-called free, and pure string assembling systems and compare their language generating power to Watson-Crick finite automata having one state (also called stateless) and two or three states in their state sets. We also study restricted variants of models that describe unary languages.</p>

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

Watson-Crick finite automata of small size and variants of string assembling systems

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年10月24日

查看全文
  • András Murvai,
  • György Vaszil

摘要

We investigate the relationship of languages characterized by variants of string assembling systems and by Watson-Crick finite automata with a small number of states. Besides the general variant, we consider so-called free, and pure string assembling systems and compare their language generating power to Watson-Crick finite automata having one state (also called stateless) and two or three states in their state sets. We also study restricted variants of models that describe unary languages.