Syntactical and automatic properties of sets of polynomials over finite fields (Q2469487)

Syntactical properties of representations of integers in various number systems are well known and have been extensively studied. In this paper, the author transposes the notion of recognizable set of integers into the framework of the polynomial ring over a finite field \(\mathbb F\). He defines \(B\)-recognizable sets of polynomials over \(\mathbb F\) and considers their first properties. It could be interesting to (try to) relate this work to results in \textit{F. von Haeseler}'s book ``Automatic sequences''. Berlin: de Gruyter (Zbl 1057.11015).