Syntactical and automatic properties of sets of polynomials over finite fields

Authors:
Michel Rigo
Affiliations:
Institute of Mathematics, University of Liège, Grande Traverse 12 (B37), B-4000 Liège, Belgium
Venue:
Finite Fields and Their Applications
Year:
2008

Citing 7
Cited 0

Linear cellular automata, finite automata and Pascal's triangle

Discrete Applied Mathematics
A new kind of science

A new kind of science
Automata, Languages, and Machines

Automata, Languages, and Machines
Subsequential Functions: Characterizations, Minimization, Examples

Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations
β-Expansions in algebraic function fields over finite fields

Finite Fields and Their Applications
Digit systems in polynomial rings over finite fields

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.