Scholarlink

In this paper we investigate the state complexity of operations related to the binary distinguishability operation defined as a combination of a closure operator and a specific Boolean formula. The extensions provided by changing the closure operator in a paper published in 2016 for the unary distinguishability operation have inspired the new operations studied here.

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

Binary Right-Distinguishability Operation

  • 章节

  • 发表日期：

    2025年

查看全文
  • Cezar Câmpeanu

摘要

In this paper we investigate the state complexity of operations related to the binary distinguishability operation defined as a combination of a closure operator and a specific Boolean formula. The extensions provided by changing the closure operator in a paper published in 2016 for the unary distinguishability operation have inspired the new operations studied here.