Prime decompositions of regular prefix codes

被引：0
|
作者：
Czyzowicz, J [1 ]
Fraczak, W
Pelc, A
Rytter, W
机构：
[1] Univ Quebec, Dept Informat, Outaouais, PQ, Canada
[2] Solidum Syst Corp, Ottawa, ON, Canada
[3] Univ Warsaw, Inst Informat, Warsaw, Poland
[4] Univ Liverpool, Dept Comp Sci, Liverpool L69 3BX, Merseyside, England
来源：
IMPLEMENTATION AND APPLICATION OF AUTOMATA | 2003年 / 2608卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
One of the new approaches to data classification uses finite state automata for representation of prefix codes. An important, task driven by the need for the efficient storage of such automata in memory is the decomposition of prefix codes into prime factors. We investigate properties of such prefix code decompositions. A linear time algorithm is designed which finds the prime decomposition F1F2...F-k of a regular prefix code F given by its minimal deterministic automaton.
引用
收藏
页码：85 / 94
页数：10
相关论文
共 50 条
  • [41] Groups and decompositions of codes
    Liu, Yun
    THEORETICAL COMPUTER SCIENCE, 2012, 443 : 70 - 81
  • [42] 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
  • [43] 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
  • [44] Regular Path Decompositions of Odd Regular Graphs
    Favaron, Odile
    Genest, Francois
    Kouider, Mekkia
    JOURNAL OF GRAPH THEORY, 2010, 63 (02) : 114 - 128
  • [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] 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
  • [48] COMBINATORIAL PROPERTY OF FINITE PREFIX CODES
    LUCA, AD
    INFORMATION AND CONTROL, 1978, 37 (03): : 267 - 279
  • [49] SELF-SYNCHRONIZATION OF PREFIX CODES
    SCHWARTZ, ES
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1964, 10 (04) : 400 - &
  • [50] ON CONCATENATIVE DECOMPOSITIONS OF REGULAR EVENTS
    PAZ, A
    PELEG, B
    IEEE TRANSACTIONS ON COMPUTERS, 1968, C 17 (03) : 229 - +
12345