The degree of a finite set of words
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).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.