Bordered Factors of a Finite Word

Abstract

In this paper, we define $\theta$-bordered factor of a word, the concept of $\theta$-valence of a bordered factor and $\theta$-sub word complexity of a word. We study some properties of involutively $\theta$-bordered factors of a word. This study can be applied in DNA computation as it gives information on the number of sites in a DNA strand that can bind with each other affecting subsequent computations.