On a special class of primitive words

DOI10.1016/j.tcs.2009.09.037zbMath1184.68311OpenAlexW1963731267MaRDI 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-)primitivityfine and wilf theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (17)

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

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

This page was built for publication: On a special class of primitive words