B. Abu Radi & O. Kupferman (2019):
Minimizing GFG Transition-Based Automata.
In: Proc. 46th Int. Colloq. on Automata, Languages, and Programming,
LIPIcs 132.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 100:1–100:16,
doi:10.4230/LIPIcs.ICALP.2019.100.
M. Bagnol & D. Kuperberg (2018):
Büchi Good-for-Games Automata Are Efficiently Recognizable.
In: Proc. 38th Conf. on Foundations of Software Technology and Theoretical Computer Science,
LIPIcs 122.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 16:1–16:14,
doi:10.4230/LIPIcs.FSTTCS.2018.16.
U. Boker, D. Kuperberg, O. Kupferman & M. Skrzypczak (2013):
Nondeterminism in the Presence of a Diverse or Unknown Future.
In: ICALP (2),
Lecture Notes in Computer Science 7966.
Springer,
pp. 89–100,
doi:10.1007/978-3-642-39212-2_11.
U. Boker, O. Kupferman & M. Skrzypczak (2017):
How Deterministic are Good-For-Games Automata?.
In: Proc. 37th Conf. on Foundations of Software Technology and Theoretical Computer Science,
Leibniz International Proceedings in Informatics (LIPIcs) 93,
pp. 18:1–18:14,
doi:10.4230/LIPIcs.FSTTCS.2017.18.
J.R. Büchi (1962):
On a Decision Method in Restricted Second Order Arithmetic.
In: Proc. Int. Congress on Logic, Method, and Philosophy of Science. 1960.
Stanford University Press,
pp. 1–12.
Th. Colcombet (2009):
The theory of stabilisation monoids and regular cost functions.
In: Proc. 36th Int. Colloq. on Automata, Languages, and Programming,
Lecture Notes in Computer Science 5556.
Springer,
pp. 139–150,
doi:10.1007/978-3-642-02930-1_12.
A. Duret-Lutz, A. Lewkowicz, A. Fauchille, Th. Michaud, E. Renault & L. Xu (2016):
Spot 2.0 — a framework for LTL and ω-automata manipulation.
In: 14th Int. Symp. on Automated Technology for Verification and Analysis,
Lecture Notes in Computer Science 9938.
Springer,
pp. 122–129,
doi:10.1007/978-3-319-46520-3_8.
D. Giannakopoulou & F. Lerda (2002):
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata.
In: Proc. 22nd International Conference on Formal Techniques for Networked and Distributed Systems,
Lecture Notes in Computer Science 2529.
Springer,
pp. 308–326,
doi:10.1007/3-540-36135-9_20.
T.A. Henzinger, O. Kupferman & S. Rajamani (2002):
Fair simulation.
Information and Computation 173(1),
pp. 64–81,
doi:10.1006/inco.2001.3085.
T.A. Henzinger & N. Piterman (2006):
Solving Games without Determinization.
In: Proc. 15th Annual Conf. of the European Association for Computer Science Logic,
Lecture Notes in Computer Science 4207.
Springer,
pp. 394–410,
doi:10.1007/11874683_26.
J.E. Hopcroft (1971):
An n ologn algorithm for minimizing the states in a finite automaton.
In: Z. Kohavi: The Theory of Machines and Computations.
Academic Press,
pp. 189–196,
doi:10.1016/B978-0-12-417750-5.50022-1.
D. Kuperberg & M. Skrzypczak (2015):
On Determinisation of Good-for-Games Automata.
In: Proc. 42nd Int. Colloq. on Automata, Languages, and Programming,
pp. 299–310,
doi:10.1007/978-3-662-47666-6_24.
O. Kupferman (2015):
Automata Theory and Model Checking.
Handbook of Theoretical Computer Science.
O. Kupferman, S. Safra & M.Y. Vardi (2006):
Relating word and tree automata.
Ann. Pure Appl. Logic 138(1-3),
pp. 126–146,
doi:10.1016/j.apal.2005.06.009.
K. Lehtinen & M. Zimmermann (2020):
Good-for-games ω-Pushdown Automata.
In: Proc. 35th IEEE Symp. on Logic in Computer Science,
pp. 689–702,
doi:10.1145/3373718.3394737.
W. Li, Sh. Kan & Z. Huang (2017):
A Better Translation From LTL to Transition-Based Generalized Büchi Automata.
IEEE Access 5,
pp. 27081–27090,
doi:10.1109/ACCESS.2017.2773123.
G. Morgenstern (2003):
Expressiveness results at the bottom of the ω-regular hierarchy.
M.Sc. Thesis, The Hebrew University.
J. Myhill (1957):
Finite automata and the representation of events.
Technical Report WADD TR-57-624, pages 112–137.
Wright Patterson AFB,
Ohio.
A. Nerode (1958):
Linear Automaton Transformations.
Proceedings of the American Mathematical Society 9(4),
pp. 541–544,
doi:10.2307/2033204.
D. Niwinski & I. Walukiewicz (1998):
Relating hierarchies of word and tree automata.
In: Proc. 15th Symp. on Theoretical Aspects of Computer Science,
Lecture Notes in Computer Science 1373.
Springer,
pp. 320–331,
doi:10.1007/BFb0028571.
S. Schewe (2010):
Beyond Hyper-Minimisation—Minimising DBAs and DPAs is NP-Complete.
In: Proc. 30th Conf. on Foundations of Software Technology and Theoretical Computer Science,
Leibniz International Proceedings in Informatics (LIPIcs) 8,
pp. 400–411,
doi:10.4230/LIPIcs.FSTTCS.2010.400.
S. Schewe (2020):
Minimising Good-for-Games automata is NP complete.
CoRR abs/2003.11979.
S. Sickert, J. Esparza, S. Jaax & J. Křetínský (2016):
Limit-Deterministic Büchi Automata for Linear Temporal Logic.
In: Proc. 28th Int. Conf. on Computer Aided Verification,
Lecture Notes in Computer Science 9780.
Springer,
pp. 312–332,
doi:10.1007/978-3-319-41540-6_17.
R.E. Tarjan (1972):
Depth first search and linear graph algorithms.
SIAM Journal of Computing 1(2),
pp. 146–160,
doi:10.1137/0201010.
M.Y. Vardi & P. Wolper (1994):
Reasoning about Infinite Computations.
Information and Computation 115(1),
pp. 1–37,
doi:10.1006/inco.1994.1092.
eptcs@eptcs.org