n-PS 码、2-后缀码和一些相关的码类

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Acta Informatica Pub Date : 2023-12-15 DOI:10.1007/s00236-023-00449-1

{"title":"n-PS 码、2-后缀码和一些相关的码类","authors":"","doi":"10.1007/s00236-023-00449-1","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> In this paper, n-PS-codes, 2-infix-outfix codes and some related classes of codes are investigated where \\(n\\ge 1\\) . The classes of n-PS-codes and 2-infix-outfix codes are generalizations of classes of prefix codes and suffix codes, and infix codes and outfix codes, respectively. The closure properties of n-PS-codes and g-3-PS-codes under composition are discussed where \\(n\\ge 1\\) , and the condition under which the class of 2-infix-outfix codes is closed under composition is provided.","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"n-PS-codes, 2-infix-outfix codes and some related classes of codes\",\"authors\":\"\",\"doi\":\"10.1007/s00236-023-00449-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3>Abstract</h3> In this paper, n-PS-codes, 2-infix-outfix codes and some related classes of codes are investigated where \\\\(n\\\\ge 1\\\\) . The classes of n-PS-codes and 2-infix-outfix codes are generalizations of classes of prefix codes and suffix codes, and infix codes and outfix codes, respectively. The closure properties of n-PS-codes and g-3-PS-codes under composition are discussed where \\\\(n\\\\ge 1\\\\) , and the condition under which the class of 2-infix-outfix codes is closed under composition is provided.\",\"PeriodicalId\":7189,\"journal\":{\"name\":\"Acta Informatica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Informatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00236-023-00449-1\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Informatica","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00236-023-00449-1","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

摘要本文研究了n-PS码、2-前缀-后缀码和一些相关的码类，其中 \(n\ge 1\) .n-PS码和2-后缀-后缀码分别是前缀码和后缀码、后缀码和后缀码的一般化。讨论了n-PS编码和g-3-PS编码在组成条件下的闭合性质，其中\(n\ge 1\) ，并提供了2-后缀-后缀编码类在组成条件下闭合的条件。

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

查看原文

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

本刊更多论文

n-PS-codes, 2-infix-outfix codes and some related classes of codes

Abstract

In this paper, n-PS-codes, 2-infix-outfix codes and some related classes of codes are investigated where \(n\ge 1\) . The classes of n-PS-codes and 2-infix-outfix codes are generalizations of classes of prefix codes and suffix codes, and infix codes and outfix codes, respectively. The closure properties of n-PS-codes and g-3-PS-codes under composition are discussed where \(n\ge 1\) , and the condition under which the class of 2-infix-outfix codes is closed under composition is provided.

求助全文

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

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.