Linked e-resources
Details
Table of Contents
First lower bounds for palindromic length / Anna E. Frid
On palindromic length of Sturmian sequences / Petr Ambrož and Edita Pelantová
Separating many words by counting occurrences of factors / Aleksi Saarela
k-Spectra of weakly-c-balanced words / Joel D. Day, Pamela Fleischmann, Florin Manea, and Dirk Nowotka
Computing the k-binomial complexity of the Thue-Morse word / Marie Lejeune, Julien Leroy, and Michel Rigo
Context-free word problem semigroups / Tara Brough, Alan J. Cain, and Markus Pfeiffer
Analysis of symbol statistics in bicomponent rational models / M. Goldwurm, J. Lin, and M. Vignati.
On palindromic length of Sturmian sequences / Petr Ambrož and Edita Pelantová
Separating many words by counting occurrences of factors / Aleksi Saarela
k-Spectra of weakly-c-balanced words / Joel D. Day, Pamela Fleischmann, Florin Manea, and Dirk Nowotka
Computing the k-binomial complexity of the Thue-Morse word / Marie Lejeune, Julien Leroy, and Michel Rigo
Context-free word problem semigroups / Tara Brough, Alan J. Cain, and Markus Pfeiffer
Analysis of symbol statistics in bicomponent rational models / M. Goldwurm, J. Lin, and M. Vignati.