Computing the k-binomial complexity of the Tribonacci word

Scientific conference in universities or research centers (Scientific conferences in universities or research centers)

Lejeune, Marie

2019

Permalink
https://hdl.handle.net/2268/235286

beamer_presentation -LASTVERSION.pdf

Author preprint (794.98 kB)

All documents in ORBi are protected by a user license.

Keywords :

tribonacci word; binomial coefficients; k-binomial complexity

Disciplines :

Mathematics

Author, co-author :

Lejeune, Marie ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes

Language :

English

Title :

Computing the k-binomial complexity of the Tribonacci word

Publication date :

03 April 2019

Event name :

Workshop post-thèse de Manon Stipulanti

Event date :

03 avril 2019

Funders :

F.R.S.-FNRS - Fonds de la Recherche Scientifique

Available on ORBi :

since 08 May 2019

Number of views

55 (8 by ULiège)

Number of downloads

28 (0 by ULiège)