INVOLUTIVELY BORDERED WORDS
From MaRDI portal
Publication:3065618
DOI10.1142/S0129054107005145zbMath1202.68295WikidataQ62046614 ScholiaQ62046614MaRDI QIDQ3065618
Publication date: 6 January 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
DNA computing; molecular computing; combinatorics of words; DNA encodings; bordered words; unbordered words
68R15: Combinatorics on words
Related Items
Watson-Crick Conjugate and Commutative Words, Watson-Crick palindromes in DNA computing, A relation by palindromic subwords, On pseudoknot-bordered words and their properties, Some properties of involution palindrome languages, Solutions to the involution language equation, WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
Cites Work
- Unnamed Item
- Unnamed Item
- Border correlation of binary words
- Relationship between the period of a finite word and the length of its unbordered segments
- \(d\)-minimal languages
- Monogenic \(e\)-closed languages and dipolar words
- Biinfinite words with maximal recurrent unbordered factors.
- Sticky-free and overhang-free DNA languages
- Counting bordered and primitive words with a fixed weight