Page 1

Displaying 1 – 3 of 3

Showing per page

Unavoidable Set: Extension and Reduction

Phan Trung Huy, Nguyen Huong Lam (2010)

RAIRO - Theoretical Informatics and Applications

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.

Currently displaying 1 – 3 of 3

Page 1