{
  "id": "1707.01010",
  "version": "v1",
  "published": "2017-07-04T14:28:01.000Z",
  "updated": "2017-07-04T14:28:01.000Z",
  "title": "Ins-Robust Primitive Words",
  "authors": [
    "Amit Kumar Srivastava",
    "Kalpesh Kapoor"
  ],
  "comment": "12 pages",
  "categories": [
    "math.CO",
    "cs.FL"
  ],
  "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 ins-robust 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 ins-robust is not context-free. We also present a linear time algorithm to recognize ins-robust primitive words and give a lower bound on the number of n-length ins-robust primitive words.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-07-04T14:28:01.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "linear time algorithm",
      "n-length ins-robust primitive words",
      "finite alphabet",
      "lower bound",
      "recognize ins-robust primitive words"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}