Deciding the topological complexity of Büchi languages
M Skrzypczak, I Walukiewicz - ICALP, 2016 - hal.science
ICALP, 2016•hal.science
We study the topological complexity of languages of Büchi automata on infinite binary trees.
We show that such a language is either Borel and WMSO-definable, or Σ 1 1-complete and
not WMSO-definable; moreover it can be algorithmically decided which of the two cases
holds. The proof relies on a direct reduction to deciding the winner in a finite game with a
regular winning condition.
We show that such a language is either Borel and WMSO-definable, or Σ 1 1-complete and
not WMSO-definable; moreover it can be algorithmically decided which of the two cases
holds. The proof relies on a direct reduction to deciding the winner in a finite game with a
regular winning condition.
We study the topological complexity of languages of Büchi automata on infinite binary trees. We show that such a language is either Borel and WMSO-definable, or Σ 1 1-complete and not WMSO-definable; moreover it can be algorithmically decided which of the two cases holds. The proof relies on a direct reduction to deciding the winner in a finite game with a regular winning condition.
hal.science
以上显示的是最相近的搜索结果。 查看全部搜索结果