机构:
McMaster Univ, Dept Comp & Software, 1280 Main St West, Hamilton, ON L8S 4K1, CanadaMcMaster Univ, Dept Comp & Software, 1280 Main St West, Hamilton, ON L8S 4K1, Canada
Mhaskar, Neerja
[1
]
Soltys, Michael
论文数: 0引用数: 0
h-index: 0
机构:
Calif State Univ Channel Isl, Dept Comp Sci, Camarillo, CA 93012 USAMcMaster Univ, Dept Comp & Software, 1280 Main St West, Hamilton, ON L8S 4K1, Canada
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
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.
机构:
Calif State Univ Channel Isl, Dept Comp Sci, One Univ Dr, Camarillo, CA 93012 USACalif State Univ Channel Isl, Dept Comp Sci, One Univ Dr, Camarillo, CA 93012 USA
Soltys, Michael
Mhaskar, Neerja
论文数: 0引用数: 0
h-index: 0
机构:
McMaster Univ, Dept Comp & Software, 1280 Main St West, Hamilton, ON L8S 4K1, CanadaCalif State Univ Channel Isl, Dept Comp Sci, One Univ Dr, Camarillo, CA 93012 USA