[en] We give some generalizations of $k$-automatic sequences replacing the $k$-ary system by an abstract numeration system on a regular language. We study some of the closure properties of these sequences and the possible extension to the multidimensional case or to infinite alphabets. The equivalence of these sequences and
morphic predicates is given and the relationship to recognizability is also investigated.
Disciplines :
Mathematics Computer science
Author, co-author :
Rigo, Michel ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
