Continuous Regular Functions

01/10/2019
by   Alexi Block Gorman, et al.
0

Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function f:[0,1] → [0,1] is r-regular if there is a Büchi automaton that accepts precisely the set of base r ∈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 PSPACE. Our proofs relies crucially on connections between automata theory and metric geometry developed by Charlier, Leroy, and Rigo.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2019

On metric regularity of Reed-Muller codes

In this work we study metric properties of the well-known family of bina...
research
09/10/2018

An Effective Property of ω-Rational Functions

We prove that ω-regular languages accepted by Büchi or Muller automata s...
research
06/26/2023

Semënov Arithmetic, Affine VASS, and String Constraints

We study extensions of Semënov arithmetic, the first-order theory of the...
research
05/29/2021

Efficient Folding Algorithms for Regular Polyhedra

We investigate the folding problem that asks if a polygon P can be folde...
research
03/28/2018

Using symbolic computation to prove nonexistence of distance-regular graphs

A package for the Sage computer algebra system is developed for checking...
research
05/05/2022

Fractal dimensions of k-automatic sets

This paper seeks to build on the extensive connections that have arisen ...
research
05/29/2023

Gravity as a Statistical Manifold/ On a bi-Connection Formulation of Gravitation

We formulate a bi-Connection Theory of Gravity whose Gravitational actio...

Please sign up or login with your details

Forgot password? Click here to reset