Syntactical and automatic properties of sets of polynomials over finite fields

Syntactical properties of representations of integers in various number systems are well known and have been extensively studied. In this paper, we transpose the notion of recognizable set of integers into the framework of the polynomial ring over a finite field F. We define B-recognizable sets of polynomials over F and consider their first properties.