On the intersection problem for quantum finite automata

IF 1 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2025-07-15 DOI:10.1016/j.tcs.2025.115454

Andrea Benso , Flavio D'Alessandro , Paolo Papi

引用次数: 0

Abstract

This paper continues the study of measure-once finite quantum automata building on work by Bertoni, Choffrut et al. We investigate conditions ensuring that, given a language recognized by such a device and a language generated by a grammar, it is decidable whether or not they have a nonempty intersection.

查看原文本刊更多论文

量子有限自动机的交问题

本文在Bertoni， Choffrut等人的工作基础上，继续研究测度一次有限量子自动机。我们研究了这样的条件，即给定由这种装置识别的语言和由语法生成的语言，它们是否具有非空交集是可确定的。

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

求助全文

约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.