Prefix-Free and Prefix-Correct Complexities with Compound Conditions

被引：0
|
作者：
Kalinina, Elena [1 ]
机构：
[1] Moscow MV Lomonosov State Univ, Dept Mech & Math, Moscow, Russia
来源：
COMPUTER SCIENCE - THEORY AND APPLICATIONS | 2010年 / 6072卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we compare two types of conditional prefix complexity assuming that conditions are sets of strings rather than strings. We show that prefix-free and prefix-correct versions of the definition are essentially different.
引用
收藏
页码：259 / 265
页数：7
相关论文
共 50 条
  • [21] A pumping lemma for regular closure of prefix-free languages
    Koga, Toshihiro
    INFORMATION AND COMPUTATION, 2022, 289
  • [22] Recursive Prefix-Free Parsing for Building Big BWTs
    Oliva, Marco
    Gagie, Travis
    Boucher, Christina
    2023 DATA COMPRESSION CONFERENCE, DCC, 2023, : 62 - 70
  • [23] Prefix-free languages: Left and right quotient and reversal
    Jirasek, Jozef
    Jiraskova, Galina
    Krausova, Monika
    Mlynarcik, Peter
    Sebej, Juraj
    THEORETICAL COMPUTER SCIENCE, 2016, 610 : 78 - 90
  • [24] Differentiability of four prefix-free PGV hash functions
    Kuwakado, Hidenori
    Hirose, Shoichi
    IEICE ELECTRONICS EXPRESS, 2009, 6 (13): : 955 - 958
  • [25] State Complexity of Boundary of Prefix-Free Regular Language
    Eom, Hae-Sung
    Han, Yo-Sub
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (06) : 697 - 707
  • [26] Evolutionary double-pipe prefix-free hash function
    Mirvaziri, Hamid
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2020, 41 (05): : 1175 - 1191
  • [27] Simplicity via provability for universal prefix-free Turing machines
    Calude, Cristian S.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (1-2) : 178 - 182
  • [28] Prefix-Free Code Distribution Matching for Probabilistic Constellation Shaping
    Cho, Junho
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (02) : 670 - 682
  • [29] Simplicity via Provability for Universal Prefix-free Turing Machines
    Calude, Cristian S.
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (01): : 16 - 21
  • [30] State Complexity of Combined Operations for Prefix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    Yu, Sheng
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 398 - +
12345