Completing comma-free codes

被引:0
|
作者
Lam, NH [1 ]
机构
[1] Hanoi Inst Math, Hanoi 10000, Vietnam
关键词
comma-free codes; completion; regular maximal comma-free codes;
D O I
10.1016/S0304-3975(02)00595-9
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We prove that for every regular comma-free code there exists a maximal comma-free code containing it which is still regular and, moreover, we can effectively locate such a completion. In particular, we can decide whether a given regular comma-free code is maximal. (C) 2002 Published by Elsevier Science B.V.
引用
收藏
页码:399 / 415
页数:17
相关论文
共 50 条
  • [21] Finite completion of comma-free codes part 1
    Lam, NH
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2004, 38 (02): : 91 - 115
  • [22] A relation between trinucleotide comma-free codes and trinucleotide circular codes
    Michel, Christian J.
    Pirillo, Giuseppe
    Pirillo, Mario A.
    THEORETICAL COMPUTER SCIENCE, 2008, 401 (1-3) : 17 - 26
  • [23] Hall sets, Lazard sets and comma-free codes
    Perrin, Dominique
    Reutenauer, Christophe
    DISCRETE MATHEMATICS, 2018, 341 (01) : 232 - 243
  • [24] FINITE STATE MODELS IN THE STUDY OF COMMA-FREE CODES
    LLEWELLYN, JA
    COMPUTER JOURNAL, 1983, 26 (04): : 303 - 311
  • [25] CONSTRUCTION OF VARIABLE-LENGTH COMMA-FREE CODES.
    Llewellyn, John A.
    1600, (28):
  • [26] Diletter and triletter comma-free codes over finite alphabets
    Fimmel, Elena
    Michel, Christian J.
    Pirot, Francois
    Sereni, Jean-sebastien
    Struengmann, Lutz
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2023, 86 : 233 - 270
  • [27] MAXIMAL AND VARIABLE WORD-LENGTH COMMA-FREE CODES
    SCHOLTZ, RA
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1969, 15 (02) : 300 - +
  • [28] CONSTRUCTION METHOD FOR PATH-INVARIANT COMMA-FREE CODES
    IMAI, H
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (04) : 555 - 559
  • [29] Finite completion of comma-free codes. Part I
    Nguyen, HL
    DEVELOPMENTS IN LANGUAGE THEORY, 2003, 2450 : 357 - 368
  • [30] CONSTRUCTION METHOD OF MULTILEVEL COMMA-FREE CODE BASED ON BINARY COMMA-FREE CODE
    KATO, M
    INOSE, H
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1972, 55 (05): : 9 - 16