Involutively bordered words
From MaRDI portal
Publication:3065618
DOI10.1142/S0129054107005145zbMATH Open1202.68295DBLPjournals/ijfcs/KariM07WikidataQ62046614 ScholiaQ62046614MaRDI QIDQ3065618FDOQ3065618
Authors: Lila Kari, Kalpana Mahalingam 
Publication date: 6 January 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relationship between the period of a finite word and the length of its unbordered segments
- \(d\)-minimal languages
- Biinfinite words with maximal recurrent unbordered factors.
- Border correlation of binary words
- Sticky-free and overhang-free DNA languages
- Monogenic \(e\)-closed languages and dipolar words
- Counting bordered and primitive words with a fixed weight
Cited In (13)
- Watson-Crick Conjugate and Commutative Words
- Disjunctivity and other properties of sets of pseudo-bordered words
- Watson-Crick palindromes in DNA computing
- On pseudoknot-bordered words and their properties
- Solutions to the involution language equation
- Title not available (Why is that?)
- Fully bordered words
- A relation by palindromic subwords
- WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
- Some properties of involution palindrome languages
- A note of involutively bordered words
- Developments in Language Theory
- Watson-Crick Partial Words
This page was built for publication: Involutively bordered words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065618)
