Back to Search
Start Over
Continuous Regular Functions
- Source :
- Logical Methods in Computer Science, Volume 16, Issue 1 (February 14, 2020) lmcs:5301
- Publication Year :
- 2019
-
Abstract
- Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function $f:[0,1] \to [0,1]$ is $r$-regular if there is a B\"{u}chi automaton that accepts precisely the set of base $r \in \mathbb{N}$ representations of elements of the graph of $f$. We show that a continuous $r$-regular function $f$ is locally affine away from a nowhere dense, Lebesgue null, subset of $[0,1]$. As a corollary we establish that every differentiable $r$-regular function is affine. It follows that checking whether an $r$-regular function is differentiable is in $\operatorname{PSPACE}$. Our proofs rely crucially on connections between automata theory and metric geometry developed by Charlier, Leroy, and Rigo.
- Subjects :
- Computer Science - Logic in Computer Science
Mathematics - Logic
Subjects
Details
- Database :
- arXiv
- Journal :
- Logical Methods in Computer Science, Volume 16, Issue 1 (February 14, 2020) lmcs:5301
- Publication Type :
- Report
- Accession number :
- edsarx.1901.03366
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.23638/LMCS-16(1:17)2020