Add to ORKGAbstract. 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 frame-work of the polynomial ring over a nite eld F. We dene B-recognizable sets of polynomials over F and consider their rst properties. 1
AbstractGeneralizing the norm and trace mappings for Fqr/Fq, we introduce an interesting class of po...
Discrete systems and properties of these are defined at a behavioral level independently of the actu...
: Discrete systems and properties of these are defined at a behavioral level independently of the ac...
Syntactical properties of representations of integers in various number systems are well-known and h...
AbstractSyntactical properties of representations of integers in various number systems are well kno...
The ring of integers and the ring of polynomials over a finite field share a lot of properties. Usin...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
A generalization of numeration systems in which NI is recognizable by finite automata can be obtaine...
In this thesis, we study and answer several questions concerning recognizability of integer sets by ...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...
International audienceLet F a finite field, Q a given element of F[T] with positive degree and k a p...
AbstractA generalization of numeration systems in which N is recognizable by finite automata can be ...
Given a function from Z(n) to itself one can determine its polynomial representability by using Kemp...
We discuss the problem of transforming representations of number fields by generating polynomials an...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
AbstractGeneralizing the norm and trace mappings for Fqr/Fq, we introduce an interesting class of po...
Discrete systems and properties of these are defined at a behavioral level independently of the actu...
: Discrete systems and properties of these are defined at a behavioral level independently of the ac...
Syntactical properties of representations of integers in various number systems are well-known and h...
AbstractSyntactical properties of representations of integers in various number systems are well kno...
The ring of integers and the ring of polynomials over a finite field share a lot of properties. Usin...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
A generalization of numeration systems in which NI is recognizable by finite automata can be obtaine...
In this thesis, we study and answer several questions concerning recognizability of integer sets by ...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...
International audienceLet F a finite field, Q a given element of F[T] with positive degree and k a p...
AbstractA generalization of numeration systems in which N is recognizable by finite automata can be ...
Given a function from Z(n) to itself one can determine its polynomial representability by using Kemp...
We discuss the problem of transforming representations of number fields by generating polynomials an...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
AbstractGeneralizing the norm and trace mappings for Fqr/Fq, we introduce an interesting class of po...
Discrete systems and properties of these are defined at a behavioral level independently of the actu...
: Discrete systems and properties of these are defined at a behavioral level independently of the ac...