三字代码\(\{a,\ aba,\ u\}\)和\(\{a,\ ab,\ v\}\)具有有限补全

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Acta Informatica Pub Date : 2025-04-16 DOI:10.1007/s00236-025-00487-x

Chunhua Cao, Lei Liao, Zhongmei Yan, Di Yang, Yuguang Yuan

引用次数: 0

摘要

是否每个三字代码都有一个有限补全？直到现在，这个著名的密码理论问题仍然没有得到解决。在这个问题的激励下，我们构造了几种形式为\(\{a,\ aba,\ u\}\)和\(\{a,\ ab,\ v\}\)的有限补全的三字码。

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

查看原文本刊更多论文

Three-word codes \(\{a,\ aba,\ u\}\) and \(\{a,\ ab,\ v\}\) having finite completions

Does every three-word code have a finite completion? Up to now, this famous question in the theory of codes remains open. Motivated by this problem, we construct several types of three-word codes with the form \(\{a,\ aba,\ u\}\) and \(\{a,\ ab,\ v\}\) which have finite completions.

求助全文

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

来源期刊

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.