Watson-Crick strong bi-catenation on words

Abstract

In this paper we define and investigate the binary word operation of strong-$ϕ$-bi-catenation (denoted by $\leftrightarrows_ϕ$) where $ϕ$ is either a morphic or an antimorphic involution. In particular, we concentrate on the mapping $ϕ=θ_{DNA}$, which models the Watson-Crick complementarity of DNA single strands. We show that such an operation is commutative and not associative and when iteratively applied to a word $u$, this operation generates words over $\{u, θ(u)\}$. We then extend this operation to languages and show that the families of regular, context-free and context-sensitive languages are closed under the operation of strong-$ϕ$-bi-catenation. We also define the notion of $\leftrightarrows_θ$-conjugacy and study conditions on words $u$ and $v$ where $u$ is a $\leftrightarrows_θ$-conjugate of $v$. We then extend this relation to language equations and provide solutions under some special cases.