Unavoidable Set: Extension and Reduction
Phan Trung Huy, Nguyen Huong Lâm · RAIRO - Theoretical Informatics and Applications · 1999
We give an explicit criterion for unavoidability of word sets. We characterize extendible, finitely and infinitely as well, elements in them. We furnish a reasonable upper bound and an exponential lower bound on the maximum leghth of words in a reduced unavoidable set of a given cardinality.