具有少量规则的半图系统的决策问题

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI:10.1109/LICS.1996.561469

Y. Matiyasevich, Géraud Sénizergues

{"title":"具有少量规则的半图系统的决策问题","authors":"Y. Matiyasevich, Géraud Sénizergues","doi":"10.1109/LICS.1996.561469","DOIUrl":null,"url":null,"abstract":"For several decision problems about semi-Thue systems, we try to locate the frontier between the decidable and the undecidable from the point of view of the number of rules. We show that the the Termination Problem, the U-Termination Problem, the Accessibility Problem and the Common-Descendant Problem are undecidable for 3 rules semi-Thue systems. As a corollary we obtain the undecidability of the Post-Correspondence Problem for 7 pairs of words.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"145","resultStr":"{\"title\":\"Decision problems for semi-Thue systems with a few rules\",\"authors\":\"Y. Matiyasevich, Géraud Sénizergues\",\"doi\":\"10.1109/LICS.1996.561469\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For several decision problems about semi-Thue systems, we try to locate the frontier between the decidable and the undecidable from the point of view of the number of rules. We show that the the Termination Problem, the U-Termination Problem, the Accessibility Problem and the Common-Descendant Problem are undecidable for 3 rules semi-Thue systems. As a corollary we obtain the undecidability of the Post-Correspondence Problem for 7 pairs of words.\",\"PeriodicalId\":382663,\"journal\":{\"name\":\"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"145\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1996.561469\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1996.561469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 145

摘要

对于半图系统的若干决策问题，我们试图从规则数的角度来确定可判定与不可判定之间的边界。我们证明了3规则半半系统的终止问题、u -终止问题、可达性问题和共同后代问题是不可判定的。作为一个推论，我们得到了7对词的后对应问题的不可判定性。

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

查看原文本刊更多论文

Decision problems for semi-Thue systems with a few rules

For several decision problems about semi-Thue systems, we try to locate the frontier between the decidable and the undecidable from the point of view of the number of rules. We show that the the Termination Problem, the U-Termination Problem, the Accessibility Problem and the Common-Descendant Problem are undecidable for 3 rules semi-Thue systems. As a corollary we obtain the undecidability of the Post-Correspondence Problem for 7 pairs of words.

求助全文

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

来源期刊

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量