RAIRO-Theor. Inf. Appl.
Volume 33, Number 3, May June 1999
|Page(s)||213 - 225|
|Published online||15 August 2002|
Unavoidable Set: Extension and Reduction
Department of Applied Mathematics,
Hanoi Institute of Technology,
1 Dai Co Viet, Hanoi, Vietnam.
2 Hanoi Institute of Mathematics, P.O. Box 631, Bo Ho, 10 000 Hanoi, Vietnam; firstname.lastname@example.org.
Accepted: 15 July 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.
Mathematics Subject Classification: 68R15 / 68S05
Key words: Unavoidable set / reduced unavoidable set / extension / reduction.
© EDP Sciences, 1999
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.