On a special class of primitive words

DOI10.1016/j.tcs.2009.09.037zbMath1184.68311MaRDI QIDQ844893

Elena Czeizler, Lila Kari, Shinnosuke Seki

Publication date: 5 February 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.037

zbMATH Keywords

word equations; (anti-)morphic involution; (pseudo-)periodicity; (pseudo-)power; (pseudo-)primitivity; fine and wilf theorem

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

ABELIAN PRIMITIVE WORDS, Unnamed Item, DE BRUIJN SEQUENCES REVISITED, Watson-Crick Partial Words, Unnamed Item, Equations enforcing repetitions under permutations, Watson-Crick powers of a word, Abelian-primitive partial words, Disjunctivity and other properties of sets of pseudo-bordered words, An extension of the Lyndon-Schützenberger result to pseudoperiodic words, The extended equation of Lyndon and Schützenberger, Hide and seek with repetitions, Embedding a \(\theta \)-invariant code into a complete one, Pseudo-solutions of word equations, Cubic patterns with permutations, Primitive sets of words, Counting (Watson-Crick) palindromes in Watson-Crick conjugates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalised fine and Wilf's theorem for arbitrary number of periods
• Twin-roots of words and their properties
• Partial words and a theorem of Fine and Wilf
• Fine and Wilf words for any periods
• On Fine and Wilf's theorem for bidimensional words.
• Fine and Wilf words for any periods. II
• Pseudopalindrome closure operators in free monoids
• An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
• Uniqueness Theorems for Periodic Functions
• Watson-Crick Conjugate and Commutative Words
• Watson-Crick palindromes in DNA computing