{"title":"Binary distinguishability operation","authors":"","doi":"10.1016/j.tcs.2024.114782","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524003992","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 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.
期刊介绍:
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.