Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T07:49:28.906Z Has data issue: false hasContentIssue false

Automata, Borel functions and real numbers in Pisot base

Published online by Cambridge University Press:  24 April 2007

Benoit Cagnard
Affiliation:
UMR CNRS 6134, université de Corse, BP 52, 20250 CORTE, France; cagnard@univ-corse.fr; simonnet@univ-corse.fr
Pierre Simonnet
Affiliation:
UMR CNRS 6134, université de Corse, BP 52, 20250 CORTE, France; cagnard@univ-corse.fr; simonnet@univ-corse.fr
Get access

Abstract

This note is about functions ƒ : Aω → Bω whose graph is recognized by a Büchi finite automaton on the product alphabet A x B. These functions are Baire class 2 in the Baire hierarchy of Borel functionsand it is decidable whether such function are continuous or not.In 1920 W. Sierpinski showed that a function $f : \mathbb{ R}\rightarrow \mathbb{R} $ is Baire class 1 if and only if both theovergraph and the undergraph of f are Fσ . We show thatsuch characterization is also true for functions on infinite wordsif we replace the real ordering by the lexicographical orderingon Bω . From this we deduce that it is decidable whethersuch function are of Baire class 1 or not. We extend this resultto real functions definable by automata in Pisot base.

Information

Type
Research Article
Copyright
© EDP Sciences, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable