Watson-Crick conjugates of words and languages
In this work, we explore the concept of Watson-Crick conjugates, also known as $θ$-conjugates (where $θ$ is an antimorphic involution), of words and languages. This concept extends the classical idea of conjugates by incorporating the Watson-Crick complementarity of DNA sequences. Our investigation initially focuses on the properties of $θ$-conjugates of words. We then define $θ$-conjugates of a language and study closure properties of certain families of languages under the $θ$-conjugate operation. Furthermore, we analyze the iterated $θ$-conjugate of both words and languages. Finally, we discuss the idea of $θ$-conjugate-free languages and examine some decidability problems related to it.
Authors
- Anuran Maity (ORCID: https://orcid.org/0000-0002-9215-1388)
- Kalpana Mahalingam (ORCID: https://orcid.org/0000-0003-2418-0512)
Publication Details
- Journal
- Discrete Mathematics & Theoretical Computer Science
- Published
- 2025-08-29
- DOI
- https://doi.org/10.46298/dmtcs.13593
- Primary Topic
- DNA and Biological Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.00