A polynomial-time algorithm for the automatic Baire property

📝 Original Info

• Title: A polynomial-time algorithm for the automatic Baire property
• ArXiv ID: 2501.15192
• Date: 2025-01-25
• Authors: Ludwig Staiger

📝 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üchi automata. To this end we give, for a restricted class of Muller automata, a conversion to equivalent Büchi automata of at most quadratic size.

💡 Deep Analysis

Deep Dive into A polynomial-time algorithm for the automatic Baire property.

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üchi automata. To this end we give, for a restricted class of Muller automata, a conversion to equivalent Büchi automata of at most quadratic size.

📄 Full Content

Reference