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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Mathematics and Theoretical Computer Science Ročník 27:3; číslo Combinatorics; s. 1 - 32
Hlavní autoři: Mahalingam, Kalpana, Maity, Anuran
Médium: Journal Article
Jazyk:angličtina
Vydáno: Nancy DMTCS 01.10.2025
Discrete Mathematics & Theoretical Computer Science
Témata:
Combinatorics
Conjugates
formal languages and automata theory
Gene sequencing
Investigations
Languages
Mathematics
Word (Linguistics)
Words (language)
India
ISSN:1365-8050, 1462-7264, 1365-8050
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.13593