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 条
  • [21] From Prime Codes to Quadratic Prime Codes
    Liu QingGe
    Lue ShanWei
    Yang DongKai
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 1473 - 1476
  • [22] From prime codes to concatenated prime codes
    Liu, Qing-Ge
    Shao, Ding-Rong
    Li, Shu-Jian
    Tongxin Xuebao/Journal on Communications, 2007, 28 (04): : 123 - 127
  • [23] A FAMILY OF CODES COMMUTATIVELY EQUIVALENT TO PREFIX CODES
    MAUCERI, S
    RESTIVO, A
    INFORMATION PROCESSING LETTERS, 1981, 12 (01) : 1 - 4
  • [24] ON THE REGULAR STRUCTURE OF PREFIX REWRITING
    CAUCAL, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 431 : 87 - 102
  • [25] ON THE REGULAR STRUCTURE OF PREFIX REWRITING
    CAUCAL, D
    THEORETICAL COMPUTER SCIENCE, 1992, 106 (01) : 61 - 86
  • [26] Optimum extensions of prefix codes
    Mandoiu, II
    INFORMATION PROCESSING LETTERS, 1998, 66 (01) : 35 - 40
  • [27] ON DECOMPOSITIONS OF REGULAR EVENTS
    BRZOZOWSKI, JA
    COHEN, R
    JOURNAL OF THE ACM, 1969, 16 (01) : 132 - +
  • [28] STRUCTURE OF SYSTEMATIC PREFIX CODES
    LASSEZ, JL
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1972, 3 (2-3) : 177 - 188
  • [29] COMPLEXITY OF ACCEPTORS FOR PREFIX CODES
    BROWN, DJ
    ELIAS, P
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (03) : 357 - 359
  • [30] Fast and Compact Prefix Codes
    Gagie, Travis
    Navarro, Gonzalo
    Nekrich, Yakov
    SOFSEM 2010: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2010, 5901 : 419 - +
12345