Affiliation:
1. IDSIA, Switzerlands
2. University of Warsaw, Warszawa, Poland
Abstract
For a given regular language of infinite trees, one can ask about the minimal number of priorities needed to recognize this language with a nondeterministic, alternating, or weak alternating parity automaton. These questions are known as, respectively, the nondeterministic, alternating, and weak Rabin-Mostowski index problems. Whether they can be answered effectively is a long-standing open problem, solved so far only for languages recognizable by deterministic automata (the alternating variant trivializes).
We investigate a wider class of regular languages, recognizable by so-called game automata, which can be seen as the closure of deterministic ones under complementation and composition. Game automata are known to recognize languages arbitrarily high in the alternating Rabin-Mostowski index hierarchy; that is, the alternating index problem does not trivialize anymore.
Our main contribution is that all three index problems are decidable for languages recognizable by game automata. Additionally, we show that it is decidable whether a given regular language can be recognized by a game automaton.
Funder
Poland’s National Science Center
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference36 articles.
1. The mu-calculus alternation-depth hierarchy is strict on binary trees;Arnold André;ITA,1999
2. André Arnold and Damian Niwiński. 2001. Rudiments of Mu-Calculus. Elsevier. André Arnold and Damian Niwiński. 2001. Rudiments of Mu-Calculus. Elsevier.
3. Continuous separation of game languages;Arnold André;Fundamenta Informaticae,2007
4. Ambiguous classes in μ-calculi hierarchies
5. Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献