Fine and Wilf's theorem for three periods and a generalization of Sturmian words

Episturmian words and episturmian morphisms

Theoretical Computer Science

Variations on a Theorem of Fine & Wilf

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science

Periodicity, morphisms, and matrices

Theoretical Computer Science - Mathematical foundations of computer science

Conjugacy and episturmian morphisms

Theoretical Computer Science

Generalised fine and Wilf's theorem for arbitrary number of periods

Theoretical Computer Science - Combinatorics on words

Preface

Theoretical Computer Science - The art of theory

Intersecting periodic words

Theoretical Computer Science

On an involution of Christoffel words and Sturmian morphisms

European Journal of Combinatorics

Graph connectivity, partial words, and a theorem of Fine and Wilf

Information and Computation

How many runs can a string contain?

Theoretical Computer Science

Periodicity properties on partial words

Information and Computation

On θ-episturmian words

European Journal of Combinatorics

Fine and Wilf words for any periods II

Theoretical Computer Science

On a generalization of Christoffel words: epichristoffel words

Theoretical Computer Science

On graphs of central episturmian words

Theoretical Computer Science

An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality

Fundamenta Informaticae

Fine and wilf's theorem for k-abelian periods

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Pseudoperiodic words

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Lyndon words and Fibonacci numbers

Journal of Combinatorial Theory Series A