2018/07/17 by Ghajendran Poovanandran, Poovanandran, Ghajendran, Adrian Atanasiu +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #05A05 #68Q45 #68R15 #Algorithms and Data Compression #Combinatorics (math.CO) #DNA and Biological Computing #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1807.06171
openalex publication_date 2018/07/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce the notion of general prints of a word, which is substantialized by certain canonical decompositions, to study repetition in words. These associated decompositions, when applied recursively on a word, result in what we term as core prints of the word. The length of the path to attain a core print of a general word is scrutinized. This paper also studies the class of square-free ternary words with respect to the Parikh matrix mapping, which is an extension of the classical Parikh mapping. It is shown that there are only finitely many matrix-equivalence classes of ternary words such that all words in each class are square-free. Finally, we employ square-free morphisms to generate infinitely many pairs of square-free ternary words that share the same Parikh matrix.