Index Problems for Game Automata
Article No.: 24, Pages 1 - 38
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.
References
[1]
André Arnold. 1999. The mu-calculus alternation-depth hierarchy is strict on binary trees. ITA 33, 4/5 (1999), 329--340.
[2]
André Arnold and Damian Niwiński. 2001. Rudiments of Mu-Calculus. Elsevier.
[3]
André Arnold and Damian Niwiński. 2007. Continuous separation of game languages. Fundamenta Informaticae 81, 1--3 (2007), 19--28.
[4]
André Arnold and Luigi Santocanale. 2005. Ambiguous classes in μ-calculi hierarchies. Theor. Comput. Sci. 333, 1--2 (2005), 265--296.
[5]
Mikołaj Bojańczyk and Thomas Place. 2012. Regular languages of infinite trees that are boolean combinations of open sets. In Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP’12). 104--115.
[6]
Julian C. Bradfield. 1998. Simplifying the modal mu-calculus alternation hierarchy. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS’98). 39--49.
[7]
Julius Richard Büchi. 1962. On a decision method in restricted second-order arithmetic. In Proceedings of the 1960 International Congress for Logic, Methodology and Philosophy of Science. 1--11.
[8]
Thomas Colcombet, Denis Kuperberg, Christof Löding, and Michael Vanden Boom. 2013. Deciding the weak definability of Büchi definable tree languages. In Proceedings of the 22nd EACLS Annual Conference (CSL’13). 215--230.
[9]
Thomas Colcombet and Christof Löding. 2008. The non-deterministic Mostowski hierarchy and distance-parity automata. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP’08). 398--409.
[10]
Jacques Duparc, Alessandro Facchini, and Filip Murlak. 2011. Definable operations on weakly recognizable sets of trees. In Proceedings of the 31st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’11). 363--374.
[11]
Jacques Duparc and Filip Murlak. 2007. On the topological complexity of weakly recognizable tree languages. In Proceedings of the 16th International Symposium on the Fundamentals of Computation Theory (FCT’07). 261--273.
[12]
E. Allen Emerson and Charanjit S. Jutla. 1991. Tree automata, mu-calculus and determinacy. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS’91). 368--377.
[13]
Alessandro Facchini, Filip Murlak, and Michał Skrzypczak. 2013. Rabin-Mostowski index problem: A step beyond deterministic automata. In Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’13). 499--508.
[14]
Alessandro Facchini, Filip Murlak, and Michał Skrzypczak. 2015. On the weak index problem for game automata. In Proceedings of the 22nd International Workshop on Logic, Language, Information, and Computation (WoLLIC’15). 93--108.
[15]
Alexander Kechris. 1995. Classical Descriptive Set Theory. Springer-Verlag, New York.
[16]
Denis Kuperberg. 2012. Etude de Classes de Fonctions de Coût Régulières. Ph.D. Dissertation. Université Paris Diderot.
[17]
Ralf Küsters and Thomas Wilke. 2002. Deciding the first level of the μ-calculus alternation hierarchy. In Proceedings of the 22nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’02). 241--252.
[18]
Robert McNaughton. 1966. Testing and generating infinite sequences by a finite automaton. Information and Control 9, 5 (1966), 521--530.
[19]
Andrzej W. Mostowski. 1984. Regular expressions for infinite trees and a standard form of automata. In Proceedings of the Fifth Symposium on Computation Theory. 157--168.
[20]
Andrzej W. Mostowski. 1991a. Games with Forbidden Positions. Technical Report. University of Gdańsk.
[21]
Andrzej W. Mostowski. 1991b. Hierarchies of weak automata and weak monadic formulas. Theor. Comput. Sci. 83, 2 (1991), 323--335.
[22]
David E. Muller, Ahmed Saoudi, and Paul E. Schupp. 1986. Alternating automata. The weak monadic theory of the tree, and its complexity. In Proceedings of the 13th International Colloquium on Automata, Languages and Programming (ICALP’86). 275--283.
[23]
Filip Murlak. 2005. On deciding topological classes of deterministic tree languages. In Proceedings of the 14th EACLS Annual Conference (CSL’05). 428--441.
[24]
Filip Murlak. 2008a. Effective Topological Hierarchies of Recognizable Tree Languages. Ph.D. Dissertation. University of Warsaw.
[25]
Filip Murlak. 2008b. Weak index versus Borel rank. In Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS’08). 573--584.
[26]
Damian Niwiński and Igor Walukiewicz. 1998. Relating hierarchies of word and tree automata. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS’98). 320--331.
[27]
Damian Niwiński and Igor Walukiewicz. 2003. A gap property of deterministic tree languages. Theor. Comput. Sci. 1, 303 (2003), 215--231.
[28]
Damian Niwiński and Igor Walukiewicz. 2005. Deciding nondeterministic hierarchy of deterministic tree automata. Electr. Notes Theor. Comput. Sci. 123 (2005), 195--208.
[29]
Martin Otto. 1999. Eliminating recursion in the μ-calculus. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS’99). 531--540.
[30]
Michael O. Rabin. 1969. Decidability of second-order theories and automata on infinite trees. Trans. of the American Math. Soc. 141 (1969), 1--35.
[31]
Michael O. Rabin. 1970. Weakly definable relations and special automata. In Proceedings of the Symposium on Mathematical Logic and Foundations of Set Theory. 1--23.
[32]
Saharon Shelah. 1975. The monadic theory of order. The Annals of Mathematics 102, 3 (1975), 379--419.
[33]
Jerzy Skurczyński. 1993. The Borel hierarchy is infinite in the class of regular sets of trees. Theor. Comput. Sci. 112, 2 (1993), 413--418.
[34]
Tomasz Fryderyk Urbański. 2000. On deciding if deterministic Rabin language is in Büchi class. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP’00). 663--674.
[35]
Michael Vanden Boom. 2012. Weak Cost Automata over Infinite Trees. Ph.D. Dissertation. University of Oxford.
[36]
William Wadge. 1983. Reducibility and Determinateness in the Baire Space. Ph.D. Dissertation. University of California, Berkeley.
[37]
Igor Walukiewicz. 2002. Deciding low levels of tree-automata hierarchy. Electr. Notes Theor. Comput. Sci. 67 (2002), 61--75.
Index Terms
- Index Problems for Game Automata
Recommendations
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer ScienceFor a given regular language of infinite trees, one can ask about the minimal number of priorities needed to recognise this language with a non-deterministic or alternating parity automaton. These questions are known as, respectively, the non-...
Alternating timed automata
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages that is closed under boolean operations and which has an ...
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata
Cellular AutomataWe present simulation and separation results between multi-dimensional deterministic and alternating cellular automata (CAs). It is shown that for any integers k≥l≥1, every k-dimensional t(n)-time deterministic CA can be simulated by an l-dimensional O(...
Comments
Information & Contributors
Information
Published In
November 2016
292 pages
Copyright © 2016 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 02 November 2016
Accepted: 01 May 2016
Revised: 01 March 2016
Received: 01 June 2015
Published in TOCL Volume 17, Issue 4
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Funding Sources
- Poland’s National Science Center
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 100Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in