Regular sequences and synchronized sequences in abstract numeration systems

12/09/2020 โˆ™ by ร‰milie Charlier, et al. โˆ™ 0 โˆ™

The notion of b-regular sequences was generalized to abstract numeration systems by Maes and Rigo in 2002. Their definition is based on a notion of ๐’ฎ-kernel that extends that of b-kernel. However, this definition does not allow us to generalize all of the many characterizations of b-regular sequences. In this paper, we present an alternative definition of ๐’ฎ-kernel, and hence an alternative definition of ๐’ฎ-regular sequences, which enables us to use recognizable formal series in order to generalize most (if not all) known characterizations of b-regular sequences to abstract numeration systems. We then give two characterizations of ๐’ฎ-automatic sequences as particular ๐’ฎ-regular sequences. Next, we present a general method to obtain various families of ๐’ฎ-regular sequences by enumerating ๐’ฎ-recognizable properties of ๐’ฎ-automatic sequences. As an example of the many possible applications of this method, we show that, provided that addition is ๐’ฎ-recognizable, the factor complexity of an ๐’ฎ-automatic sequence defines an ๐’ฎ-regular sequence. In the last part of the paper, we study ๐’ฎ-synchronized sequences. Along the way, we prove that the formal series obtained as the composition of a synchronized relation and a recognizable series is recognizable. As a consequence, the composition of an ๐’ฎ-synchronized sequence and a ๐’ฎ-regular sequence is shown to be ๐’ฎ-regular. All our results are presented in an arbitrary dimension d and for an arbitrary semiring ๐•‚.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.