判定两个码是否具有相同的歧义是协同np问题

2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI:10.1109/SYNASC57785.2022.00023

Yannick Chevalier, M. Rusinowitch

{"title":"判定两个码是否具有相同的歧义是协同np问题","authors":"Yannick Chevalier, M. Rusinowitch","doi":"10.1109/SYNASC57785.2022.00023","DOIUrl":null,"url":null,"abstract":"We define a code to be a finite set of words C on a finite alphabet, and an ambiguity to be an equality between two words in the monoid C*. We recall that a code is uniquely decipherable if its ambiguities are trivial. In this paper we construct a finite-turn deterministic pushdown automaton that recognizes the set of ambiguities of a code. This allows one to show that whether two codes of the same size have the same ambiguities is in co-NP.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Deciding Whether two Codes Have the Same Ambiguities is in co-NP\",\"authors\":\"Yannick Chevalier, M. Rusinowitch\",\"doi\":\"10.1109/SYNASC57785.2022.00023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We define a code to be a finite set of words C on a finite alphabet, and an ambiguity to be an equality between two words in the monoid C*. We recall that a code is uniquely decipherable if its ambiguities are trivial. In this paper we construct a finite-turn deterministic pushdown automaton that recognizes the set of ambiguities of a code. This allows one to show that whether two codes of the same size have the same ambiguities is in co-NP.\",\"PeriodicalId\":446065,\"journal\":{\"name\":\"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC57785.2022.00023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC57785.2022.00023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们将码定义为有限字母表上的有限词集C，将歧义定义为单形C*中两个词之间的等式。我们记得，如果一个代码的歧义是微不足道的，那么它是唯一可破译的。在本文中，我们构造了一个有限转的确定性下推自动机来识别代码的歧义集。这可以证明两个相同大小的代码是否具有相同的歧义是在协同np中。

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

查看原文本刊更多论文

Deciding Whether two Codes Have the Same Ambiguities is in co-NP

We define a code to be a finite set of words C on a finite alphabet, and an ambiguity to be an equality between two words in the monoid C*. We recall that a code is uniquely decipherable if its ambiguities are trivial. In this paper we construct a finite-turn deterministic pushdown automaton that recognizes the set of ambiguities of a code. This allows one to show that whether two codes of the same size have the same ambiguities is in co-NP.

求助全文

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

来源期刊

2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

自引率

0.00%

发文量