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 条
  • [41] On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity
    Martijn Baartse
    George Barmpalias
    Theory of Computing Systems, 2013, 52 : 28 - 47
  • [42] Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity
    Bauwens, Bruno
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 100 - 108
  • [43] Universal computably enumerable sets and initial segment prefix-free complexity
    Barmpalias, George
    INFORMATION AND COMPUTATION, 2013, 233 : 41 - 59
  • [44] Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    Wood, Derick
    FUNDAMENTA INFORMATICAE, 2009, 90 (1-2) : 93 - 106
  • [45] Indifferentiable security analysis of popular hash functions with prefix-free padding
    Chang, Donghoon
    Lee, Sangjin
    Nandi, Mridul
    Yung, Mori
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2006, 2006, 4284 : 283 - +
  • [46] Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
    Farina, Antonio
    Gagie, Travis
    Manzini, Giovanni
    Navarro, Gonzalo
    Ordonez, Alberto
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2016, 2016, 9954 : 50 - 60
  • [47] Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
    Jiraskova, Galina
    Mlynarcik, Peter
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 222 - 233
  • [48] Faster algorithm for designing optimal prefix-free codes with unequal letter costs
    Dumitrescu, Sorina
    FUNDAMENTA INFORMATICAE, 2006, 73 (1-2) : 107 - 117
  • [49] Faster algorithm for designing optimal prefix-free codes with unequal letter costs
    Dumitrescu, Sorina
    DCC 2006: Data Compression Conference, Proceedings, 2006, : 444 - 444
  • [50] Prefix-Free Frequency Domain Equalization for Underwater Acoustic Single Carrier Transmissions
    Tu, Xingbin
    Song, Aijun
    Xu, Xiaomei
    IEEE ACCESS, 2018, 6 : 2578 - 2588
12345