Homomorphisms Preserve Some Languages Related to Prefix Codes

被引：0
|
作者：
Cao Chunhua [1 ]
Geng Jingrong [2 ]
Yang Di [3 ,4 ]
Sha Li [4 ]
机构：
[1] Yunnan Univ, Sch Math & Stat, Yunnan, Kunming, Peoples R China
[2] Yunnan Coll Business Management, Dept Fdn, Kunming, Peoples R China
[3] Kunming Univ Sci & Technol, Fac Mat & Met Engn, Kunming, Peoples R China
[4] Yunnan Univ Finance & Econ, Informat Sch, Kunming, Peoples R China
来源：
HIGH PERFORMANCE NETWORKING, COMPUTING, AND COMMUNICATION SYSTEMS | 2011年 / 163卷
关键词：
homomorphism; prefix code; left singular languages; rho(d)-independent languages;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Let X* be the free monoid on a finite alphabet X. This paper deals with homomorphisms over X* which preserve prefix codes, left singular languages and rho(d)- independent languages. Prefix codes preserving homomorphism which we discuss is a modification in the paper by Shyr and. Thierrin in 1977.
引用
收藏
页码：257 / +
页数：3
相关论文
共 50 条
  • [41] Completing prefix codes in submonoids
    Néraud, J
    THEORETICAL COMPUTER SCIENCE, 2006, 356 (1-2) : 245 - 254
  • [42] Optimal prefix codes for some families of two-dimensional geometric distributions
    Bassino, Frederique
    Clement, Julien
    Seroussi, Gadiel
    Viola, Alfredo
    DCC 2006: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2006, : 113 - +
  • [43] Two properties of prefix codes and uniquely decodable codes
    Xu, Jie
    Zheng, Zhiyong
    Tian, Kun
    Chen, Man
    DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (10) : 3321 - 3330
  • [44] Two properties of prefix codes and uniquely decodable codes
    Jie Xu
    Zhiyong Zheng
    Kun Tian
    Man Chen
    Designs, Codes and Cryptography, 2023, 91 : 3321 - 3330
  • [45] Regular Languages meet Prefix Sorting
    Alanko, Jarno
    D'Agostino, Giovanna
    Policriti, Alberto
    Prezza, Nicola
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 911 - 930
  • [46] Prefix Distance Between Regular Languages
    Ng, Timothy
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2016, 9705 : 224 - 235
  • [47] N-PREFIX SUFFIX LANGUAGES
    ITO, M
    JURGENSEN, H
    SHYR, HJ
    THIERRIN, G
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1989, 30 (1-2) : 37 - 56
  • [48] Regular Languages meet Prefix Sorting
    Alanko, Jarno
    D'Agostino, Giovanna
    Policriti, Alberto
    Prezza, Nicola
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 911 - 930
  • [49] The Boundary of Prefix-Free Languages
    Jirasek, Jozef
    Jiraskova, Galina
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 300 - 312
  • [50] On n-power prefix languages
    Fan, Chen-Ming
    Huang, C. C.
    Yu, S. S.
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2008, 85 (05) : 703 - 715
12345