AbstractSyntactical 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
AbstractWe investigate the computational power of finite-field arithmetic operations as compared to ...
AbstractSpecial algebraic structures, which are rings of functions with finite support, are introduc...
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
Syntactical properties of representations of integers in various number systems are well-known and h...
Abstract. Syntactical properties of representations of integers in various number systems are well-k...
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...
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 ac...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
Discrete systems and properties of these are defined at a behavioral level independently of the actu...
A generalization of numeration systems in which NI is recognizable by finite automata can be obtaine...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...
This book provides a brief and accessible introduction to the theory of finite fields and to some of...
International audienceLet F a finite field, Q a given element of F[T] with positive degree and k a p...
AbstractWe investigate the computational power of finite-field arithmetic operations as compared to ...
AbstractSpecial algebraic structures, which are rings of functions with finite support, are introduc...
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
Syntactical properties of representations of integers in various number systems are well-known and h...
Abstract. Syntactical properties of representations of integers in various number systems are well-k...
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...
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 ac...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
Discrete systems and properties of these are defined at a behavioral level independently of the actu...
A generalization of numeration systems in which NI is recognizable by finite automata can be obtaine...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...
This book provides a brief and accessible introduction to the theory of finite fields and to some of...
International audienceLet F a finite field, Q a given element of F[T] with positive degree and k a p...
AbstractWe investigate the computational power of finite-field arithmetic operations as compared to ...
AbstractSpecial algebraic structures, which are rings of functions with finite support, are introduc...
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
DOI
Add to ORKG