WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID

DOI10.1142/S0129054108006200zbMath1175.68247WikidataQ62046611 ScholiaQ62046611MaRDI QIDQ3542877

Lila Kari, Kalpana Mahalingam

Publication date: 1 December 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

hairpin-like structure

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Related Items (2)

Watson-Crick Partial Words ⋮ Watson-Crick palindromes in DNA computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(d\)-minimal languages
• Sticky-free and overhang-free DNA languages
• The syntactic monoid of a hypercode
• The syntactic monoid of hairpin-free languages
• INVOLUTIVELY BORDERED WORDS
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• The syntactic monoid of the semigroup generated by a comma-free code
• The syntactic monoid of the semigroup generated by a maximal prefix code

This page was built for publication: WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID