Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Watson-Crick conjuga ...
Article

Watson-Crick conjugates of words and languages

Kalpana Mahalingam, Anuran Maity
Download article
Open on arXiv
Submitted on
May 15, 2024
Accepted on
August 19, 2025
Published on
August 29, 2025
Last modified on
August 29, 2025
Volume 27
vol. 27:3
Combinatorics
DOI
10.46298/dmtcs.13593
License
arXiv.org - Non-exclusive license to distribute
Indicators
879
Views
973
Downloads

Watson-Crick conjugates of words and languages

Kalpana Mahalingam, Anuran Maity
Abstract
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.
Keywords
  • Formal Languages and Automata Theory
  • Combinatorics
Mathematics Subject Classification 2020
  • 68Q07 - Biologically inspired models of computation (DNA computing, membrane computing, etc.)
  • 68Q10 - Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
  • 68Q45 - Formal languages and automata
  • 68R15 - Combinatorics on words
Preview
Loading PDF preview...