F-sets and finite automata
DOI10.5802/JTNB.1070zbMATH Open1475.11038arXiv1712.03800OpenAlexW2969519964MaRDI QIDQ2199490FDOQ2199490
Authors: Jason P. Bell, Rahim Moosa
Publication date: 11 September 2020
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.03800
Recommendations
semiabelian varieties\(F\)-setsautomatics setspositive characteristic Mordell-LangSkolem-Mahler-Lech
Automata sequences (11B85) Positive characteristic ground fields in algebraic geometry (14G17) Group schemes (14L15)
Cites Work
- Automatic Sequences
- On vanishing coefficients of algebraic power series over fields of positive characteristic
- Title not available (Why is that?)
- The Mordell-Lang conjecture for function fields
- Finding the growth rate of a regular or context-free language in polynomial time
- Title not available (Why is that?)
- Bounded Regular Sets
- A GENERALISED SKOLEM–MAHLER–LECH THEOREM FOR AFFINE VARIETIES
- A Skolem-Mahler-Lech theorem in positive characteristic and finite automata
- Title not available (Why is that?)
- The isotrivial case in the Mordell-Lang Theorem
- F -structures and integral points on semiabelian varieties over finite fields
- Characterizing regular languages with polynomial densities
- Division points on subvarieties of isotrivial semi-abelian varieties
- Title not available (Why is that?)
- A generalised Skolem-Mahler-Lech theorem for affine varieties
Cited In (7)
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
- Automata and tame expansions of \((\mathbb{Z}, +)\)
- Descriptive set theoretic methods in automata theory. Decidability and topological complexity
- Quantitative estimates for the size of an intersection of sparse automatic sets
- CONTRIBUTIONS TO THE THEORY OF F-AUTOMATIC SETS
- Support of an algebraic series as the range of a recursive sequence
- A refinement of Christol's theorem for algebraic power series
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)