Achim Blumensath, Thomas Colcombet & Christof Löding (2008):
Logical theories and compatible operations.
In: Jörg Flum, Erich Grädel & Thomas Wilke: Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas],
Texts in Logic and Games 2.
Amsterdam University Press,
pp. 73–106.
Mikołaj Bojańczyk, Claire David, Anca Muscholl, Thomas Schwentick & Luc Segoufin (2011):
Two-variable logic on data words.
ACM Transactions on Computational Logic 12(4),
pp. 27,
doi:10.1145/1970398.1970403.
J. Richard Büchi (1966):
On a Decision Method in Restricted Second Order Arithmetic.
In: Ernest Nagel, Patrick Suppes & Alfred Tarski: Proceedings of the 1960 International Congress on Logic, Methodology and Philosophy of Science,
Studies in Logic and the Foundations of Mathematics 44.
Elsevier,
pp. 1–11,
doi:10.1016/S0049-237X(09)70564-6.
J. Richard Büchi & Lawrence H. Landweber (1969):
Solving Sequential Conditions by Finite-State Strategies.
Transactions of the American Mathematical Society 138,
pp. 295–311,
doi:10.2307/1994916.
Claudia Carapelle, Shiguang Feng, Alexander Kartzow & Markus Lohrey (2015):
Satisfiability of ECTL* with Tree Constraints.
In: Lev D. Beklemishev & Daniil V. Musatov: Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings,
Lecture Notes in Computer Science 9139.
Springer,
pp. 94–108,
doi:10.1007/978-3-319-20297-6_7.
Arnaud Carayol & Matthew Hague (2014):
Regular Strategies in Pushdown Reachability Games.
In: Joël Ouaknine, Igor Potapov & James Worrell: Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings,
Lecture Notes in Computer Science 8762.
Springer,
pp. 58–71,
doi:10.1007/978-3-319-11439-2_5.
Bruno Courcelle & Joost Engelfriet (2012):
Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach.
Encyclopedia of Mathematics and its Applications 138.
Cambridge University Press,
doi:10.1017/CBO9780511977619.
Christopher Czyba, Christopher Spinrath & Wolfgang Thomas (2015):
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change.
In: Igor Potapov: Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings.,
Lecture Notes in Computer Science 9168.
Springer,
pp. 203–214,
doi:10.1007/978-3-319-21500-6_16.
Stéphane Demri & Ranko Lazic (2009):
LTL with the freeze quantifier and register automata.
ACM Trans. Comput. Log. 10(3),
doi:10.1145/1507244.1507246.
Heinz-Dieter Ebbinghaus, Jörg Flum & Wolfgang Thomas (1994):
Mathematical logic (2. ed.).
Undergraduate Texts in Mathematics.
Springer,
doi:10.1007/978-1-4757-2355-7.
E. Allen Emerson & Charanjit S. Jutla (1991):
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract).
In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991.
IEEE Computer Society,
pp. 368–377,
doi:10.1109/SFCS.1991.185392.
D. Gale & F.M. Stewart (1953):
Infinite games with perfect information.
In: Contributions to the Theory of Games,
Ann. Math. Studies.
Princeton Univ. Press, Princeton, N.J.,
pp. 245–266,
doi:10.1515/9781400881970-014.
Erich Grädel & Simon Leßenich (2012):
Banach-Mazur Games with Simple Winning Strategies.
In: Patrick Cégielski & Arnaud Durand: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France,
LIPIcs 16.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 305–319,
doi:10.4230/LIPIcs.CSL.2012.305.
Michael Kaminski & Nissim Francez (1994):
Finite-Memory Automata.
Theoretical Computer Science 134(2),
pp. 329–363,
doi:10.1016/0304-3975(94)90242-9.
Alexander S. Kechris (1995):
Classical Descriptive Set Theory.
Graduate Texts in Mathematics 156.
Springer New York,
New York, NY,
doi:10.1007/978-1-4612-4190-4.
Yiannis N. Moschovakis (2009):
Descriptive set theory 155.
American Mathematical Soc.,
doi:10.1090/surv/155.
Wolfgang Thomas (1997):
Languages, Automata, and Logic.
In: Grzegorz Rozenberg & Arto Salomaa: Handbook of Formal Languages.
Springer Berlin Heidelberg,
pp. 389–455,
doi:10.1007/978-3-642-59126-6_7.
Igor Walukiewicz (2001):
Pushdown Processes: Games and Model-Checking.
Information and Computation 164(2),
pp. 234–263,
doi:10.1006/inco.2000.2894.
Igor Walukiewicz (2002):
Monadic second-order logic on tree-like structures.
Theoretical Computer Science 275(1-2),
pp. 311–346,
doi:10.1016/S0304-3975(01)00185-2.
eptcs@eptcs.org