$L$-Primitive Words in Submonoids
Formal Languages and Automata Theory
2014-03-25 v1
Abstract
This work considers a natural generalization of primitivity with respect to a language. Given a language , a nonempty word is said to be -primitive if is not a proper power of any word in . After ascertaining the number of primitive words in submonoids of a free monoid, the work proceeds to count -primitive words in submonoids of a free monoid. The work also studies the distribution of -primitive words in certain subsets of free monoids.
Cite
@article{arxiv.1403.5788,
title = {$L$-Primitive Words in Submonoids},
author = {Shubh Narayan Singh and K. V. Krishna},
journal= {arXiv preprint arXiv:1403.5788},
year = {2014}
}