F-sets and finite automata
From MaRDI portal
Publication:2199490
Abstract: The classical notion of a k-automatic subset of the natural numbers is here extended to that of an F-automatic subset of an arbitrary finitely generated abelian group equipped with an arbitrary endomorphism F. This is applied to the isotrivial positive characteristic Mordell-Lang context where F is the Frobenius action on a commutative algebraic group G over a finite field, and is a finitely generated F-invariant subgroup of G. It is shown that the F-subsets of introduced by the second author and Scanlon are F-automatic. It follows that when G is semiabelian and X is a closed subvariety then X intersect is F-automatic. Derksen's notion of a k-normal subset of the natural numbers is also here extended to the above abstract setting, and it is shown that F-subsets are F-normal. In particular, the X intersect appearing in the Mordell-Lang problem are F-normal. This generalises Derksen's Skolem-Mahler-Lech theorem to the Mordell-Lang context.
Recommendations
Cites work
- scientific article; zbMATH DE number 3808970 (Why is no real title available?)
- scientific article; zbMATH DE number 3978429 (Why is no real title available?)
- scientific article; zbMATH DE number 721811 (Why is no real title available?)
- scientific article; zbMATH DE number 2220973 (Why is no real title available?)
- A GENERALISED SKOLEM–MAHLER–LECH THEOREM FOR AFFINE VARIETIES
- A Skolem-Mahler-Lech theorem in positive characteristic and finite automata
- A generalised Skolem-Mahler-Lech theorem for affine varieties
- Automatic Sequences
- Bounded Regular Sets
- Characterizing regular languages with polynomial densities
- Division points on subvarieties of isotrivial semi-abelian varieties
- F -structures and integral points on semiabelian varieties over finite fields
- Finding the growth rate of a regular or context-free language in polynomial time
- On vanishing coefficients of algebraic power series over fields of positive characteristic
- The Mordell-Lang conjecture for function fields
- The isotrivial case in the Mordell-Lang Theorem
Cited in
(7)- Support of an algebraic series as the range of a recursive sequence
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
- CONTRIBUTIONS TO THE THEORY OF F-AUTOMATIC SETS
- Automata and tame expansions of \((\mathbb{Z}, +)\)
- A refinement of Christol's theorem for algebraic power series
- Descriptive set theoretic methods in automata theory. Decidability and topological complexity
- Quantitative estimates for the size of an intersection of sparse automatic sets
This page was built for publication: \(F\)-sets and finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199490)