Article (Scientific journals)
Syntactictal and automatic properties of sets of polynomials over finite fields
Rigo, Michel
2008In Finite Fields and Their Applications, 42, p. 258-276
Peer Reviewed verified by ORBi
 

Files


Full Text
ff.pdf
Author preprint (190.56 kB)
Request a copy

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
Recognizable sets; Automata; Polynomial over a finite field; numeration system
Abstract :
[en] 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.
Disciplines :
Computer science
Mathematics
Author, co-author :
Rigo, Michel  ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Syntactictal and automatic properties of sets of polynomials over finite fields
Publication date :
2008
Journal title :
Finite Fields and Their Applications
ISSN :
1071-5797
eISSN :
1090-2465
Publisher :
Academic Press
Volume :
42
Pages :
258-276
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBi :
since 01 July 2009

Statistics


Number of views
45 (2 by ULiège)
Number of downloads
1 (1 by ULiège)

Scopus citations®
 
4
Scopus citations®
without self-citations
2
OpenCitations
 
3

Bibliography


Similar publications



Contact ORBi