Disjunctivity and other properties of sets of pseudo-bordered words

DOI10.1007/s00236-016-0258-1zbMath1371.68222OpenAlexW2273670553MaRDI QIDQ530214

Manasi S. Kulkarni, Lila Kari

Publication date: 9 June 2017

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-016-0258-1

zbMATH Keywords

DNA computingdisjunctivitybordered wordspseudo-bordered wordspseudo-unbordered wordsunbordered words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Deque automata, languages, and planar graph representations

Cites Work

• Decidability of involution hypercodes
• On a special class of primitive words
• On pseudoknot-bordered words and their properties
• \(d\)-minimal languages
• Pseudopalindrome closure operators in free monoids
• Finding Pseudo-Repetitions
• Testing Generalised Freeness of Words
• A note of involutively bordered words
• An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality
• INVOLUTIVELY BORDERED WORDS
• Pseudoperiodic Words
• A universal algorithm for sequential data compression
• Jewels of Stringology
• Discovering Hidden Repetitions in Words
• Algorithms on Strings
• Watson-Crick Conjugate and Commutative Words
• Periodic-like words, periodicity, and boxes
• Watson-Crick palindromes in DNA computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item