Primitive sets of words

DOI10.1016/j.tcs.2021.03.003zbMath1485.68204arXiv2005.10668OpenAlexW3136124930MaRDI QIDQ2662680

Antonio Restivo, Gabriele Fici, Giuseppa Castiglione

Publication date: 14 April 2021

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

Full work available at URL: https://arxiv.org/abs/2005.10668

zbMATH Keywords

primitive setpseudo-repetition\(k\)-maximal monoidhidden repetitionbi-root

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

On primitive words with non-primitive product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on intersections of free submonoids of a free monoid
• The equation \(a_ M=b^ Nc^ P\) in a free group
• On a special class of primitive words
• Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
• On the defect theorem and simplifiability
• Sur le théorème du defaut
• On the rank of the subsets of a free monoid
• Deciding whether a finite set of words has rank at most two
• Hide and seek with repetitions
• Many aspects of defect theorems
• On sets of words of rank two
• The intersection of free submonoids of a free monoid is free
• Finding Pseudo-Repetitions
• PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS
• Elementariness of a finite set of words is co-NP-complete
• On a question of McNaughton and Papert
• Discovering Hidden Repetitions in Words

This page was built for publication: Primitive sets of words