论文信息 - Fine and Wilf's Theorem for k-Abelian Periods - 字舞流文

Fine and Wilf's Theorem for k-Abelian Periods

Two words u and v are k-abelian equivalent if they contain the same number of occurrences of each factor of length at most k. This leads to a hierarchy of equivalence relations on words which lie p...

Juhani Karhumäki | Svetlana Puzynina | Aleksi Saarela | J. Karhumäki | S. Puzynina | Aleksi Saarela

[1] H. Wilf,et al. Uniqueness theorems for periodic functions , 1965 .

[2] Jean Berstel,et al. Partial Words and a Theorem of Fine and Wilf , 1999, Theor. Comput. Sci..

[3] Antonio Restivo,et al. Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words , 1999, Theor. Comput. Sci..

[4] F. Blanchet-Sadri. Periodicity on Partial Words , 2004 .

[5] Арсений Михайлович Шур,et al. Частичные слова и свойство взаимодействия периодов@@@Partial words and the interaction property of periods , 2004 .

[6] R. Tijdeman,et al. Fine and Wilf words for any periods II , 2009, Theor. Comput. Sci..

[7] Lila Kari,et al. An Improved Bound for an Extension of Fine and Wilf's Theorem and Its Optimality , 2010, Fundam. Informaticae.

[8] Juhani Karhumäki,et al. Problems in between words and abelian words: k-abelian avoidability , 2012, Theor. Comput. Sci..