The degree of a finite set of words
Formal Languages and Automata Theory
2022-07-28 v2
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 is a composition of finite sets of words with complete, then .
Keywords
Cite
@article{arxiv.2106.14471,
title = {The degree of a finite set of words},
author = {Dominique Perrin and Andrew Ryzhikov},
journal= {arXiv preprint arXiv:2106.14471},
year = {2022}
}