arXiv · 2307.11745
Alternating state complexity of the set of primes and squarefree integers
Abstract
We show that the set of prime numbers has exponential alternating complexity, proving a conjecture by Fijalkow. We further show that the set of squarefree integers has essentially maximal possible alternating complexity.
Explore related subjects
Keep this discovery
Jan-Christoph Schlage-Puchta. 2023-07-21. Alternating state complexity of the set of primes and squarefree integers. https://arxiv.org/abs/2307.11745
Cite the original work for its findings. Save a collection to share your selection of sources.