A Formal Framework for Stringology

被引:0
|
作者
Mhaskar, Neerja [1 ]
Soltys, Michael [2 ]
机构
[1] McMaster Univ, Dept Comp & Software, 1280 Main St West, Hamilton, ON L8S 4K1, Canada
[2] Calif State Univ Channel Isl, Dept Comp Sci, Camarillo, CA 93012 USA
关键词
proof complexity; string algorithms;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A new formal framework for Stringology is proposed, which consists of a three-sorted logical theory S designed to capture the combinatorial reasoning about finite words. A witnessing theorem is proven which demonstrates how to extract algorithms for constructing strings from their proofs of existence. Various other applications of the theory are shown. The long term goal of this line of research is to introduce the tools of Proof Complexity to the analysis of strings.
引用
收藏
页码:90 / 103
页数:14
相关论文
共 50 条
  • [1] A formal framework for Stringology
    Soltys, Michael
    Mhaskar, Neerja
    DISCRETE APPLIED MATHEMATICS, 2020, 274 (274) : 141 - 151
  • [2] Stringology algorithms
    Holub, Jan
    DISCRETE APPLIED MATHEMATICS, 2014, 163 : 237 - 237
  • [3] Preface: Stringology Algorithms
    Holub, Jan
    DISCRETE APPLIED MATHEMATICS, 2020, 274 : 1 - 1
  • [4] Special Issue on Stringology Preface
    Janicki, Ryszard
    Puglisi, Simon J.
    Raman, M. Sohel
    FUNDAMENTA INFORMATICAE, 2009, 97 (03) : I - II
  • [5] Old and New in Stringology
    Galil, Zvi
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2010, 6129 : 26 - 26
  • [6] Randomization in parallel stringology
    Muthukrishnan, S
    PARALLEL AND DISTRIBUTED PROCESSING, 1998, 1388 : 361 - 362
  • [7] Editorial: Stringology Algorithms
    Holub, Jan
    DISCRETE APPLIED MATHEMATICS, 2016, 212 : 1 - 1
  • [8] Correctness-by-Construction in Stringology
    Watson, Bruce W.
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012, 2012, : 1 - 2
  • [9] A FORMAL FRAMEWORK FOR AUTHENTICATION
    BOYD, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 648 : 273 - 292
  • [10] A Formal Framework for Adaptation
    Amja, Anne Marie
    Obaid, Abdel
    Mili, Hafedh
    Jarir, Zahi
    UBIQUITOUS NETWORKING, UNET 2017, 2017, 10542 : 81 - 94