An Algorithm to Test if a Given Circular HDOL-Language Avoids a Pattern
暂无分享,去创建一个
[1] Julien Cassaigne. Motifs evitables et regularites dans les mots , 1994 .
[2] Filippo Mignosi,et al. If a D0L Language is k-Power Free then it is Circular , 1993, ICALP.
[3] A. Zimin. BLOCKING SETS OF TERMS , 1984 .
[4] Brigitte Mossé,et al. Puissances de mots et reconnaissabilité des point fixes d'une substitution , 1992, Theor. Comput. Sci..
[5] Arturo Carpi. On Representation Systems , 1994, Int. J. Algebra Comput..
[6] James D. Currie,et al. Open problems in pattern avoidance , 1993 .
[7] K. A. Baker,et al. Growth Problems for Avoidable Words , 1989, Theor. Comput. Sci..
[8] Dwight R. Bean,et al. Avoidable patterns in strings of symbols , 1979 .
[9] G. Rozenberg,et al. Repetition of Subwords in DOL Languages , 1984, Inf. Control..
[10] Umberto Eco,et al. Theory of Codes , 1976 .