两个周期态射的二元广义PCP在多项式时间内是可判定的

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS

International Journal of Foundations of Computer Science Pub Date : 2023-10-16 DOI:10.1142/s0129054123480076

Vesa Halava, Štěpán Holub

{"title":"两个周期态射的二元广义PCP在多项式时间内是可判定的","authors":"Vesa Halava, Štěpán Holub","doi":"10.1142/s0129054123480076","DOIUrl":null,"url":null,"abstract":"We show that the binary generalized Post’s Correspondence Problem is decidable in polynomial time for the case where both morphisms are periodic. Our result is based on combinatorial properties and we have formalized the proofs and verified correctness of our algorithm using the Isabelle/HOL formal proof system.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time\",\"authors\":\"Vesa Halava, Štěpán Holub\",\"doi\":\"10.1142/s0129054123480076\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that the binary generalized Post’s Correspondence Problem is decidable in polynomial time for the case where both morphisms are periodic. Our result is based on combinatorial properties and we have formalized the proofs and verified correctness of our algorithm using the Isabelle/HOL formal proof system.\",\"PeriodicalId\":50323,\"journal\":{\"name\":\"International Journal of Foundations of Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0129054123480076\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129054123480076","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

证明了在两个态射都是周期的情况下，二元广义Post’s对应问题在多项式时间内是可判定的。我们的结果是基于组合性质的，我们已经使用Isabelle/HOL形式证明系统形式化证明并验证了我们算法的正确性。

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

查看原文本刊更多论文

Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time

We show that the binary generalized Post’s Correspondence Problem is decidable in polynomial time for the case where both morphisms are periodic. Our result is based on combinatorial properties and we have formalized the proofs and verified correctness of our algorithm using the Isabelle/HOL formal proof system.

求助全文

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

来源期刊

International Journal of Foundations of Computer Science 工程技术-计算机：理论方法

CiteScore

1.60

自引率

12.50%

发文量

审稿时长

3 months

期刊介绍： The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include: - Algebraic theory of computing and formal systems - Algorithm and system implementation issues - Approximation, probabilistic, and randomized algorithms - Automata and formal languages - Automated deduction - Combinatorics and graph theory - Complexity theory - Computational biology and bioinformatics - Cryptography - Database theory - Data structures - Design and analysis of algorithms - DNA computing - Foundations of computer security - Foundations of high-performance computing