Optimal Bounds for Transformations of omega-Automata. - Christof Löding (FSTTCS, 1999)

Alternating Automata and Logics over Infinite Words. - Christof Löding; Wolfgang Thomas (IFIP TCS, 2000)

Efficient minimization of deterministic weak omega-automata. - Christof Löding (Inf. Process. Lett., 2001)

Model-Checking Infinite Systems Generated by Ground Tree Rewriting. - Christof Löding (FoSSaCS, 2002)

Ground Tree Rewriting Graphs of Bounded Tree Width. - Christof Löding (STACS, 2002)

Model Checking and Satisfiability for Sabotage Modal Logic. - Christof Löding; Philipp Rohde (FSTTCS, 2003)

Solving the Sabotage Game Is PSPACE-Hard. - Christof Löding; Philipp Rohde (MFCS, 2003)

Visibly Pushdown Games. - Christof Löding; P. Madhusudan; Olivier Serre (FSTTCS, 2004)

A Characterization of First-Order Topological Properties of Planar Spatial Data. - Michael Benedikt; Christof Löding; Jan Van den Bussche; Thomas Wilke (PODS, 2004)

On the Expressiveness of Deterministic Transducers over Infinite Trees. - Thomas Colcombet; Christof Löding (STACS, 2004)

Synthesis of Open Reactive Systems from Scenario-Based Specifications. - Yves Bontemps; Pierre-Yves Schobbens; Christof Löding (Fundam. Informaticae, 2004)

Deterministic Automata on Unranked Trees. - Wolfgang Thomas; Julien Cristau; Christof Löding (Foundations of Semistructured Data, 2005)

Propositional Dynamic Logic with Recursive Programs. - Christof Löding; Olivier Serre (FoSSaCS, 2006)

Regularity Problems for Visibly Pushdown Languages. - Vince Bárány; Christof Löding; Olivier Serre (STACS, 2006)

A characterization of first-order topological properties of planar spatial data. - Michael Benedikt; Bart Kuijpers; Christof Löding; Jan Van den Bussche; Thomas Wilke (J. ACM, 2006)

Reachability Problems on Regular Ground Tree Rewriting Graphs. - Christof Löding (Theory Comput. Syst., 2006)

MSO on the Infinite Binary Tree: Choice and Order. - Arnaud Carayol; Christof Löding (CSL, 2007)

Unranked Tree Automata with Sibling Equalities and Disequalities. - Karianto Wong; Christof Löding (ICALP, 2007)

Transition Graphs of Rewriting Systems over Unranked Trees. - Christof Löding; Alex Spelten (MFCS, 2007)

Memory Reduction for Strategies in Infinite Games. - Michael Holtmann; Christof Löding (CIAA, 2007)

Propositional dynamic logic with recursive programs. - Christof Löding; Carsten Lutz; Olivier Serre (J. Log. Algebraic Methods Program., 2007)

Transforming structures by set interpretations. - Thomas Colcombet; Christof Löding (Log. Methods Comput. Sci., 2007)

Logical theories and compatible operations. - Achim Blumensath; Thomas Colcombet; Christof Löding (Logic and Automata, 2008)

The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. - Thomas Colcombet; Christof Löding (CSL, 2008)

The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. - Thomas Colcombet; Christof Löding (ICALP (2), 2008)

On Nondeterministic Unranked Tree Automata with Sibling Constraints. - Christof Löding; Karianto Wong (FSTTCS, 2009)

Obliging Games. - Krishnendu Chatterjee; Florian Horn 001; Christof Löding (CONCUR, 2010)

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. - Nicolas Bousquet 001; Christof Löding (LATA, 2010)

Regular Cost Functions over Finite Trees. - Thomas Colcombet; Christof Löding (LICS, 2010)

Infinite games and automata theory. - Christof Löding (Lectures in Game Theory for Computer Scientists, 2011)

Degrees of Lookahead in Context-free Infinite Games. - Wladimir Fridman; Christof Löding; Martin Zimmermann 002 (CSL, 2011)

Basics on Tree Automata. - Christof Löding (Modern Applications of Automata Theory, 2012)

Improved Ramsey-Based Büchi Complementation. - Stefan Breuers; Christof Löding; Jörg Olschewski (FoSSaCS, 2012)

Regularity Problems for Weak Pushdown ω-Automata and Games. - Christof Löding; Stefan Repke (MFCS, 2012)

Efficient inclusion testing for simple classes of unambiguous ω-automata. - Dimitri Isaak; Christof Löding (Inf. Process. Lett., 2012)

Learning Universally Quantified Invariants of Linear Data Structures. - Pranav Garg 001; Christof Löding; P. Madhusudan; Daniel Neider (CAV, 2013)

Deciding the weak definability of Büchi definable tree languages. - Thomas Colcombet; Denis Kuperberg; Christof Löding; Michael Vanden Boom (CSL, 2013)

Unambiguous Finite Automata. - Christof Löding (Developments in Language Theory, 2013)

Decidability Results on the Existence of Lookahead Delegators for NFA. - Christof Löding; Stefan Repke (FSTTCS, 2013)

Modeling and Verification of Infinite Systems with Resources. - Martin Lang 001; Christof Löding (Log. Methods Comput. Sci., 2013)

ICE: A Robust Framework for Learning Invariants. - Pranav Garg 001; Christof Löding; P. Madhusudan; Daniel Neider (CAV, 2014)

Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games. - Simon Tenbusch; Christof Löding; Frank G. Radmacher; James Gross (MASS, 2014)

Definability and Transformations for Cost Logics and Automatic Structures. - Martin Lang 001; Christof Löding; Amaldev Manuel (MFCS (1), 2014)

Decision Problems for Deterministic Pushdown Automata on Infinite Words. - Christof Löding (AFL, 2014)

Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations. - Christof Löding; Sarah Winter (GandALF, 2014)

A Unified Approach to Boundedness Properties in MSO. - Lukasz Kaiser; Martin Lang 001; Simon Leßenich; Christof Löding (CSL, 2015)

Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists. - Pranav Garg 001; Christof Löding; P. Madhusudan; Daniel Neider (Formal Methods Syst. Des., 2015)

Simplification Problems for Deterministic Pushdown Automata on Infinite Words. - Christof Löding (Int. J. Found. Comput. Sci., 2015)

On Equivalence and Uniformisation Problems for Finite Transducers. - Emmanuel Filiot; Ismaël Jecker; Christof Löding; Sarah Winter (ICALP, 2016)

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. - Arnaud Carayol; Christof Löding; Olivier Serre (LICS, 2016)

Transformation Between Regular Expressions and omega-Automata. - Christof Löding; Andreas Tollkötter (MFCS, 2016)

Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers. - Christof Löding; Sarah Winter (MFCS, 2016)

Abstract Learning Frameworks for Synthesis. - Christof Löding; P. Madhusudan; Daniel Neider (TACAS, 2016)

Learning MSO-definable hypotheses on strings. - Martin Grohe; Christof Löding; Martin Ritzert (ALT, 2017)

Learning MSO-definable hypotheses on string. - Martin Grohe; Christof Löding; Martin Ritzert (CoRR, 2017)

On Finitely Ambiguous Büchi Automata. - Christof Löding; Anton Pirogov (DLT, 2018)

Pure Strategies in Imperfect Information Stochastic Games. - Arnaud Carayol; Christof Löding; Olivier Serre (Fundam. Informaticae, 2018)

Foundations for natural proofs and quantifier instantiation. - Christof Löding; P. Madhusudan; Lucas Peña (Proc. ACM Program. Lang., 2018)

New Optimizations and Heuristics for Determinization of Büchi Automata. - Christof Löding; Anton Pirogov (ATVA, 2019)

Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. - Christof Löding; Anton Pirogov (ICALP, 2019)

New Pumping Technique for 2-Dimensional VASS. - Wojciech Czerwinski; Slawomir Lasota 001; Christof Löding; Radoslaw Piórkowski (MFCS, 2019)

Tree Automata with Global Constraints for Infinite Trees. - Patrick Landwehr; Christof Löding (STACS, 2019)

Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. - Christof Löding; Christopher Spinrath (Discret. Math. Theor. Comput. Sci., 2019)

State Space Reduction For Parity Automata. - Christof Löding; Andreas Tollkötter (CSL, 2020)

Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. - Christof Löding; Anton Pirogov (FoSSaCS, 2020)

Synthesis from Weighted Specifications with Partial Domains over Finite Words. - Emmanuel Filiot; Christof Löding; Sarah Winter (FSTTCS, 2020)

Synthesizing Lemmas for Inductive Reasoning. - Adithya Murali; Lucas Peña; Christof Löding; P. Madhusudan (CoRR, 2020)

Projection for Büchi Tree Automata with Constraints between Siblings. - Patrick Landwehr; Christof Löding (Int. J. Found. Comput. Sci., 2020)

Automata on infinite trees. - Christof Löding (Handbook of Automata Theory (I.), 2021)

Automata on finite trees. - Christof Löding; Wolfgang Thomas (Handbook of Automata Theory (I.), 2021)

Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm. - León Bohn; Christof Löding (MFCS, 2021)

Passive Learning of Deterministic Büchi Automata by Combinations of DFAs. - León Bohn; Christof Löding (ICALP, 2022)

On Minimization and Learning of Deterministic ω-Automata in the Presence of Don't Care Words. - Christof Löding; Max Philip Stachon (Fundam. Informaticae, 2022)

Model-guided synthesis of inductive lemmas for FOL with least fixpoints. - Adithya Murali; Lucas Peña; Eion Blanchard; Christof Löding; P. Madhusudan (Proc. ACM Program. Lang., 2022)

A Regular and Complete Notion of Delay for Streaming String Transducers. - Emmanuel Filiot; Ismaël Jecker; Christof Löding; Sarah Winter (STACS, 2023)

Resynchronized Uniformization and Definability Problems for Rational Relations. - Christof Löding; Sarah Winter (Discret. Math. Theor. Comput. Sci., 2023)

A First-order Logic with Frames. - Adithya Murali; Lucas Peña; Christof Löding; P. Madhusudan (ACM Trans. Program. Lang. Syst., 2023)

On the Boolean Closure of Deterministic Top-Down Tree Automata. - Christof Löding; Wolfgang Thomas (Int. J. Found. Comput. Sci., 2024)

Constructing Deterministic Parity Automata from Positive and Negative Examples. - León Bohn; Christof Löding (TheoretiCS, 2024)

Saturation Problems for Families of Automata. - León Bohn; Yong Li 031; Christof Löding; Sven Schewe (ICALP, 2025)

Finite-valued Streaming String Transducers. - Emmanuel Filiot; Ismaël Jecker; Gabriele Puppis; Christof Löding; Anca Muscholl; Sarah Winter (TheoretiCS, 2025)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning. - Christof Löding; Igor Walukiewicz (CoRR, 2025)

A Hyperlogic for Strategies in Stochastic Games (Extended Version). - Lina Gerlach; Christof Löding; Erika Ábrahám (CoRR, 2025)