Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Unavoidable Set: Extension and Reduction

Phan Trung HuyNguyen 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.

Page 1

Download Results (CSV)