InsRobust Primitive Words
Abstract
Let Q be the set of primitive words over a finite alphabet with at least two symbols. We characterize a class of primitive words, Q_I, referred to as insrobust primitive words, which remain primitive on insertion of any letter from the alphabet and present some properties that characterizes words in the set Q_I. It is shown that the language Q_I is dense. We prove that the language of primitive words that are not insrobust is not contextfree. We also present a linear time algorithm to recognize insrobust primitive words and give a lower bound on the number of nlength insrobust primitive words.
 Publication:

arXiv eprints
 Pub Date:
 July 2017
 arXiv:
 arXiv:1707.01010
 Bibcode:
 2017arXiv170701010S
 Keywords:

 Mathematics  Combinatorics;
 Computer Science  Formal Languages and Automata Theory
 EPrint:
 12 pages