A note on the relation between recognisable series and regular sequences, and their minimal linear representations (Q6149153)

The initial goal of the authors was to implement an algorithm in SageMath to find a linear representation of minimal dimension of a \(k\)-regular sequence (in the sense of Allouche and Shallit) and they were experimenting on what can go wrong with minimisation. Therefore they precisely elaborate the connection between recognisable series (in the sense of Berstel and Reutenauer) and \(k\)-regular sequences via their linear representations. They show that the minimisation algorithm for recognisable series can also be used to minimise linear representations of \(q\)-regular sequences.