2000 character limit reached
$L$-Primitive Words in Submonoids
Published 23 Mar 2014 in cs.FL | (1403.5788v1)
Abstract: This work considers a natural generalization of primitivity with respect to a language. Given a language $L$, a nonempty word $w$ is said to be $L$-primitive if $w$ is not a proper power of any word in $L$. After ascertaining the number of primitive words in submonoids of a free monoid, the work proceeds to count $L$-primitive words in submonoids of a free monoid. The work also studies the distribution of $L$-primitive words in certain subsets of free monoids.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.