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 条
  • [31] Bit recycling with prefix codes
    Dube, Danny
    Beaudoin, Vincent
    DCC 2007: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2007, : 379 - 379
  • [32] PREFIX CODES, TREES, AND AUTOMATA
    LASSEZ, JL
    INFORMATION SCIENCES, 1975, 8 (02) : 155 - 171
  • [33] PREFIX CODES AND ISOMORPHIC AUTOMATA
    LASSEZ, JL
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1973, 3 (04) : 309 - 314
  • [34] A Cipher Based on Prefix Codes
    Grosek, Otokar
    Hromada, Viliam
    Horak, Peter
    SENSORS, 2021, 21 (18)
  • [35] COMPLETE FINITE PREFIX CODES
    PERRIN, D
    PERROT, JF
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1969, 269 (24): : 1116 - &
  • [36] EFFICIENT DECODING OF PREFIX CODES
    HIRSCHBERG, DS
    LELEWER, DA
    COMMUNICATIONS OF THE ACM, 1990, 33 (04) : 449 - 459
  • [37] Prefix Codes for Power Laws
    Baer, Michael B.
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2464 - 2468
  • [38] Conjugacy relations of prefix codes
    He, Yong
    Cui, Zhenhe
    Yuan, Zihan
    THEORETICAL COMPUTER SCIENCE, 2016, 635 : 85 - 93
  • [39] DENDROGRAMS AND IRREDUCIBLE PREFIX CODES
    MCALPIN, J
    NIKOLOPOULOS, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 507 : 179 - 184
  • [40] Completing prefix codes in submonoids
    Néraud, J
    THEORETICAL COMPUTER SCIENCE, 2006, 356 (1-2) : 245 - 254
12345