The degree of a finite set of words

2021/06/28 by Perrin, Dominique, Ryzhikov, Andrew
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)

paper · doi:10.48550/arxiv.2106.14471

Abstract

We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if X=Y∘ Z is a composition of finite sets of words with Y complete, then d(X)≤ d(Y)d(Z).

Related

• From Monomials to Words to graphs
• L-Primitive Words in Submonoids
• Primitive Sets of Words
• On Sets of Words of Rank Two
• On finitely generated submonoids of virtually free groups