FINITELY BASED WORDS
Olga Sapir · International Journal of Algebra and Computation · 2000
Let W be a finite language and let W c be the closure of W under taking subwords. Let S(W) denote the Rees quotient of a free monoid over the ideal consisting of all words that are not in W c . We call W finitely based if the monoid S(W) is finitely based. Although these semigroups have easy structure they behave "generically" with respect to the finite basis property [6]. In this paper, we describe all finitely based words in a two-letter alphabet. We also find some necessary and some sufficient conditions for a set of words to be finitely based.