Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 48 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 107 tok/s Pro
Kimi K2 205 tok/s Pro
GPT OSS 120B 473 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata (2404.17530v1)

Published 26 Apr 2024 in cs.FL

Abstract: Our main technical contribution is a polynomial-time determinisation procedure for history-deterministic B\"uchi automata, which settles an open question of Kuperberg and Skrzypczak, 2015. A key conceptual contribution is the lookahead game, which is a variant of Bagnol and Kuperberg's token game, in which Adam is given a fixed lookahead. We prove that the lookahead game is equivalent to the 1-token game. This allows us to show that the 1-token game characterises history-determinism for semantically-deterministic B\"uchi automata, which paves the way to our polynomial-time determinisation procedure.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (23)
  1. Bader Abu Radi and Orna Kupferman. Minimization and Canonization of GFG Transition-Based Automata. Logical Methods in Computer Science, 18(3), 2022. doi:10.46298/lmcs-18(3:16)2022.
  2. Büchi Good-for-Games Automata Are Efficiently Recognizable. In Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, volume 122 of LIPIcs, pages 16:1–16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. doi:10.4230/LIPIcs.FSTTCS.2018.16.
  3. History-Determinism vs. Fair Simulation. To appear.
  4. On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR, abs/2009.14437, 2020. arXiv:2009.14437.
  5. Token Games and History-Deterministic Quantitative-Automata. Logical Methods in Computer Science, 19(4), 2023. doi:10.46298/LMCS-19(4:8)2023.
  6. When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism. ACM SIGLOG News, 10(1):24–51, 2023. doi:10.1145/3584676.3584682.
  7. Deciding Parity Games in Quasi-polynomial Time. SIAM J. Comput., 51(2):17–152, 2022. doi:10.1137/17m1145288.
  8. Generalized Parity Games. In Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, volume 4423 of Lecture Notes in Computer Science, pages 153–167. Springer, 2007. doi:10.1007/978-3-540-71389-0_12.
  9. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of Lecture Notes in Computer Science. Springer, 2002. doi:10.1007/3-540-36387-4.
  10. Trees, Automata, and Games. In Symposium on Theory of Computing, STOC 1982, pages 60–65. ACM, 1982. doi:10.1145/800070.802177.
  11. Solving Games Without Determinization. In Computer Science Logic, CSL 2006, volume 4207 of Lecture Notes in Computer Science, pages 395–410. Springer, 2006. doi:10.1007/11874683_26.
  12. Marcin Jurdzinski. Small Progress Measures for Solving Parity Games. In STACS 2000, volume 1770 of Lecture Notes in Computer Science, pages 290–301. Springer, 2000. URL: https://doi.org/10.1007/3-540-46541-3_24.
  13. Succinct Progress Measures for Solving Parity Games. In Symposium on Logic in Computer Science, LICS 2017, pages 1–9. IEEE Computer Society, 2017. doi:10.1109/LICS.2017.8005092.
  14. On Determinisation of Good-for-Games Automata. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, volume 9135 of Lecture Notes in Computer Science, pages 299–310. Springer, 2015. doi:10.1007/978-3-662-47666-6_24.
  15. Orna Kupferman. Using the Past for Resolving the Future. Frontiers Comput. Sci., 4, 2022. doi:10.3389/fcomp.2022.1114625.
  16. A Recursive Approach to Solving Parity Games in Quasipolynomial Time. Log. Methods Comput. Sci., 18(1), 2022. doi:10.46298/lmcs-18(1:8)2022.
  17. Donald A. Martin. Borel Determinacy. Annals of Mathematics, 102(2):363–371, 1975. URL: http://www.jstor.org/stable/1971035.
  18. Aditya Prakash. Checking History-Determinism is NP-hard for Parity Automata. In Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I, volume 14574 of Lecture Notes in Computer Science, pages 212–233. Springer, 2024. doi:10.1007/978-3-031-57228-9_11.
  19. On History-Deterministic One-Counter Nets. In Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, volume 13992 of Lecture Notes in Computer Science, pages 218–239. Springer, 2023. doi:10.1007/978-3-031-30829-1_11.
  20. On Semantically-Deterministic Automata. In International Colloquium on Automata, Languages, and Programming, ICALP 2023, volume 261 of LIPIcs, pages 109:1–109:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.109.
  21. A Hierarchy of Nondeterminism. In Mathematical Foundations of Computer Science, MFCS 2021, volume 202 of LIPIcs, pages 85:1–85:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.MFCS.2021.85.
  22. Sven Schewe. Minimising Good-For-Games Automata Is NP-Complete. In Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, volume 182 of LIPIcs, pages 56:1–56:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. doi:10.4230/LIPICS.FSTTCS.2020.56.
  23. Igor Walukiewicz. Monadic Second-Order Logic on Tree-like Structures. Theor. Comput. Sci., 275(1-2):311–346, 2002. doi:10.1016/S0304-3975(01)00185-2.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up
Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets