Unavoidable sets and conjugacy classes

被引:0
|
作者
Champarnaud, JM [1 ]
Hansel, G [1 ]
机构
[1] Univ Rouen, LIFAR, F-76821 Mont St Aignan, France
关键词
D O I
10.36045/bbms/1074791325
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A set of words X is said to be unavoidable on a given alphabet A if every infinite word on A has a factor in X. The cardinality of an unavoidable set of words of length k on an alphabet A is not less than the number of conjugacy classes of words of length k on A. We show how to construct an unavoidable set of words of length k the cardinality of which is equal to the number of conjugacy classes.
引用
收藏
页码:679 / 691
页数:13
相关论文
共 50 条