A polynomial-time algorithm for the automatic Baire property

TL;DR

This paper presents a polynomial-time algorithm to construct open and meagre sets with the Baire property in the Cantor space, using finite automata, and also provides a conversion method to B"uchi automata.

Contribution

It introduces a polynomial-time method for constructing definable open and meagre sets from Muller automata and offers a conversion to simpler B"uchi automata.

Findings

Constructed open and meagre sets in polynomial time from Muller automata.

Provided a quadratic size conversion from certain Muller automata to B"uchi automata.

Enabled the use of simpler automata to define topologically simple sets.

Abstract

A subset of a topological space possesses the Baire property if it can be covered by an open set up to a meagre set. For the Cantor space of infinite words Finkel introduced the automatic Baire category where both sets, the open and the meagre, can be chosen to be definable by finite automata. Here we show that, given a Muller automaton defining the original set, resulting open and meagre sets can be constructed in polynomial time. Since the constructed sets are of simple topological structure, it is possible to construct not only Muller automata defining them but also the simpler B\"uchi automata. To this end we give, for a restricted class of Muller automata, a conversion to equivalent B\"uchi automata of at most quadratic size.