Binary distinguishability operation

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Theoretical Computer Science Pub Date : 2024-08-20 DOI:10.1016/j.tcs.2024.114782

引用次数: 0

Abstract

This paper analyzes a new distinguishability operation for finite deterministic machines and languages. The research was inspired by the “Gedanken experiments” on sequential machines performed by Moore in 1956, and extends the study of the unary distinguishability operation to a binary one. Besides studying the new operation's properties, we give a tight bound of its state complexity on regular languages, including the case for finite languages.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

二进制区分操作

本文分析了有限确定性机器和语言的一种新的可区分性运算。这项研究受到摩尔（Moore）1956 年对顺序机器进行的 "Gedanken 实验 "的启发，并将对一元可区分性运算的研究扩展到二元运算。除了研究新运算的特性，我们还给出了它在常规语言（包括有限语言）上的状态复杂度的严格约束。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.

期刊最新文献

Editorial Board Finding and counting small tournaments in large tournaments Truthful two-facility location with candidate locations Path partitions of phylogenetic networks On the existence of funneled orientations for classes of rooted phylogenetic networks