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 条
  • [1] Prime decompositions of regular languages
    Han, Yo-Sub
    Salomaa, Kai
    Wood, Derick
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 145 - 155
  • [2] CHARACTERIZATIONS FOR THE REGULAR PREFIX CODES AND RELATED FAMILIES
    VELOSO, PAS
    INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1980, 9 (05): : 371 - 382
  • [3] CHARACTERIZING THE REGULAR PREFIX CODES AND RIGHT POWER-BOUNDED LANGUAGES
    VELOSO, PAS
    INFORMATION PROCESSING LETTERS, 1979, 9 (01) : 5 - 7
  • [4] Prime decomposition problem for several kinds of regular codes
    Van Hung, Kieu
    Van, Do Long
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2006, 2006, 4281 : 213 - 227
  • [5] New strongly regular decompositions of the complete graphs with prime power vertices
    Momihara, Koji
    Okumura, Yu
    FINITE FIELDS AND THEIR APPLICATIONS, 2015, 36 : 63 - 80
  • [6] Characterizing classes of regular languages using prefix codes of bounded synchronization delay
    Diekert, Volker
    Walter, Tobias
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2017, 27 (06) : 561 - 589
  • [7] Orthogonal Decompositions of Regular Graphs and Designing Tree-Hamming Codes
    Shabana, Hanan
    El-Shanawany, Ramadan
    Halawa, Sahar
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2024, 17 (04): : 3492 - 3516
  • [8] REGULAR PREFIX RELATIONS
    ANGLUIN, D
    HOOVER, DN
    MATHEMATICAL SYSTEMS THEORY, 1984, 17 (03): : 167 - 191
  • [9] Regular Decompositions
    Moroz, Guillaume
    COMPUTER MATHEMATICS, 2008, 5081 : 263 - 277
  • [10] On the lattice of prefix codes
    Restivo, A
    Silva, PV
    THEORETICAL COMPUTER SCIENCE, 2002, 289 (01) : 755 - 782
12345