An Effective Property of ω-Rational Functions

09/10/2018
by   Olivier Finkel, et al.
0

We prove that ω-regular languages accepted by Büchi or Muller automata satisfy an effective automata-theoretic version of the Baire property. Then we use this result to obtain a new effective property of rational functions over infinite words which are realized by finite state Büchi transducers: for each such function F: Σ^ω→Γ^ω, one can construct a deterministic Büchi automaton A accepting a dense Π^0_2-subset of Σ^ω such that the restriction of F to L(A) is continuous.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2021

Parikh's theorem for infinite alphabets

We investigate commutative images of languages recognised by register au...
research
05/15/2019

Deciding the Computability of Regular Functions over Infinite Words

The class of regular functions from infinite words to infinite words is ...
research
01/10/2019

Continuous Regular Functions

Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function...
research
02/13/2023

Deterministic regular functions of infinite words

Regular functions of infinite words are (partial) functions realized by ...
research
07/23/2023

Saturating automata for game semantics

Saturation is a fundamental game-semantic property satisfied by strategi...
research
11/30/2019

Pebble-Intervals Automata and FO2 with Two Orders (Extended Version)

We introduce a novel automata model, called pebble-intervals automata (P...
research
05/27/2020

From Functional Nondeterministic Transducers to Deterministic Two-Tape Automata

The question whether P = NP revolves around the discrepancy between acti...

Please sign up or login with your details

Forgot password? Click here to reset