Computing the k-binomial complexity of the Tribonacci word

Unpublished conference/Abstract (Scientific congresses and symposiums)

Lejeune, Marie

2019 • WORDS 2019

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

beamer_presentation.pdf

Author preprint (712.48 kB)

All documents in ORBi are protected by a user license.

Keywords :

combinatorics on words; k-binomial relation; Tribonacci

Abstract :

[en] Oral presentation of the associated paper that was published in the conference proceeding.

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 :

12 September 2019

Event name :

WORDS 2019

Event place :

Loughborough, United Kingdom

Event date :

du 09 septembre 2019 au 13 septembre 2019

Audience :

International

Funders :

F.R.S.-FNRS - Fonds de la Recherche Scientifique [BE]

Available on ORBi :

since 05 February 2020

Number of views

32 (1 by ULiège)

Number of downloads

5 (1 by ULiège)