More on Generalized Automatic Sequences
Michel Rigo, Arnaud Maes · ORBi (University of Liège) · 2002
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.