Ins-Robust Primitive Words
Combinatorics
2017-08-04 v2 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.1707.01010,
title = {Ins-Robust Primitive Words},
author = {Amit Kumar Srivastava and Kalpesh Kapoor},
journal= {arXiv preprint arXiv:1707.01010},
year = {2017}
}
Comments
12 pages