量子自动机和有限指数语言

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-19 DOI:arxiv-2406.13797

Andrea Benso, Flavio D'Alessandro, Paolo Papi

{"title":"量子自动机和有限指数语言","authors":"Andrea Benso, Flavio D'Alessandro, Paolo Papi","doi":"arxiv-2406.13797","DOIUrl":null,"url":null,"abstract":"This paper is a continuation of a previous study on the so-called measure\nonce finite quantum automata model introduced by Moore and Crutchfield in 2000.\nWe investigate conditions assuring that, given a language recognized by such a\ndevice and a language generated by a context-free grammar of finite index or by\na matrix context-free grammar, it is recursively decidable whether or not they\nhave a nonempty intersection.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"206 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum automata and languages of finite index\",\"authors\":\"Andrea Benso, Flavio D'Alessandro, Paolo Papi\",\"doi\":\"arxiv-2406.13797\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is a continuation of a previous study on the so-called measure\\nonce finite quantum automata model introduced by Moore and Crutchfield in 2000.\\nWe investigate conditions assuring that, given a language recognized by such a\\ndevice and a language generated by a context-free grammar of finite index or by\\na matrix context-free grammar, it is recursively decidable whether or not they\\nhave a nonempty intersection.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"206 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Formal Languages and Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.13797\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.13797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文是对摩尔和克拉奇菲尔德 2000 年提出的所谓 measureonce 有限量子自动机模型研究的延续。我们研究了一些条件，以确保在给定由这种设备识别的语言和由有限索引的无上下文语法或矩阵无上下文语法生成的语言的情况下，它们是否具有非空交集是可递归判定的。

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

查看原文

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

本刊更多论文

Quantum automata and languages of finite index

This paper is a continuation of a previous study on the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We investigate conditions assuring that, given a language recognized by such a device and a language generated by a context-free grammar of finite index or by a matrix context-free grammar, it is recursively decidable whether or not they have a nonempty intersection.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Formal Languages and Automata Theory

自引率

0.00%

发文量

期刊最新文献

Query Learning of Advice and Nominal Automata Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny Run supports and initial algebra supports of weighted automata Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata $\mathbb{N}$-polyregular functions arise from well-quasi-orderings