Logical characterization of recognizable sets of polynomials over a finite field
From MaRDI portal
Publication:2909094
Recommendations
- Syntactical and automatic properties of sets of polynomials over finite fields
- Recursively enumerable sets of polynomials over a finite field
- A theorem on sets of polynomials over a finite field
- On value sets of polynomials over a finite field
- scientific article; zbMATH DE number 1866863
- Value Sets of Polynomials Over Finite Fields
- Polynomial spaces over finite fields
- Polynomials over finite fields with a given value set
- Decidability of sub-theories of polynomials over a finite field
- Polynomial multiplicities over finite fields and intersection sets
Cites work
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- Automatic Sequences
- Decidability of sub-theories of polynomials over a finite field
- Elimination theory for addition and the frobenius map in polynomial rings
- Independent numeration systems and syndeticity
- On an exponential predicate in polynomials over finite fields
- On the base-dependence of sets of numbers recognizable by finite automata
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- Syntactical and automatic properties of sets of polynomials over finite fields
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
- Unrecognizable Sets of Numbers
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(6)- Syntactical and automatic properties of sets of polynomials over finite fields
- Uniform families of polynomial equations over a finite field and structures admitting an Euler characteristic of definable sets.
- Generalized hex and logical characterizations of polynomial space
- Defining multiplication in some additive expansions of polynomial rings
- Rational digit systems over finite fields and Christol's theorem
- Recognizable sets of power series over finite fields
This page was built for publication: Logical characterization of recognizable sets of polynomials over a finite field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909094)
