Optimal Bounds for Transformations of ω-Automata-Reference-Cited by-同舟云学术

Optimal Bounds for Transformations of ω-Automata

Published:1999 Issue: Volume: Page:97-109
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Löding Christof

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46691-6_8

Reference18 articles.

1. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Method and Philos. Sci. 1960, pages 1–11, 1962. 97, 99

2. J.R. Büchi. Winning state-strategies for boolean-F σ games. manuscript, 1981. 97, 98, 103

3. J.R. Büchi. State-strategies for games in F σδ ∩ G δσ. Journal of Symbolic Logic, 48(4):1171–1198, December 1983. 97, 98, 103

4. S. Dziembowski, M. Jurdziński, and I. Walukiewicz. How much memory is needed to win infinite games? In Proc. IEEE, LICS, 1997. 97, 98, 104, 104, 104

5. Y. Gurevich and L. Harrington. Trees, automata and games. In Proc. 14th ACM Symp. on the Theory of Computing, pages 60–65, 1982. 97, 98, 103

Cited by 40 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Stochastic games with lexicographic objectives;Formal Methods in System Design;2023-03-08

2. Modular Mix-and-Match Complementation of Büchi Automata;Tools and Algorithms for the Construction and Analysis of Systems;2023

3. Zielonka DAG Acceptance and Regular Languages over Infinite Words;Developments in Language Theory;2023

4. From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata;International Journal on Software Tools for Technology Transfer;2022-07-23

5. Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition;Computer Aided Verification;2022