abstract numeration system; bounded language; multiplication by a constant
Abstract :
[en] In this talk, I will present some results concerning multiplication by a constant in an abstract numeration system built on a bounded language. More precisely, we will show that this operation does not preserve regularity, and therefore cannot be computed by a finite automaton.
Disciplines :
Mathematics
Author, co-author :
Charlier, Emilie ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Abstract numeration systems and recognizability
Publication date :
January 2007
Event name :
Rencontres Arithmétique de l'Informatique Mathématique