Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2509.00355 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908510573297664 |
|---|---|
| author | Mahalingam, Kalpana |
| author_facet | Mahalingam, Kalpana |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_00355 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Watson-Crick strong bi-catenation on words Mahalingam, Kalpana Combinatorics 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. |
| title | Watson-Crick strong bi-catenation on words |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2509.00355 |