{"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}
引用次数: 0
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
