Christof Löding

114 papers A* 12A 7B 24C 5Journal 48Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Layered automata: A canonical model for automata over infinite words. CoRR Antonio Casares, Christof Löding, Igor Walukiewicz
2025	J	`jnl`	A Hyperlogic for Strategies in Stochastic Games (Extended Version). CoRR Lina Gerlach, Christof Löding, Erika Ábrahám
2025	—	`conf`	A Hyperlogic for Strategies in Stochastic Games. QEST+FORMATS Lina Gerlach, Christof Löding, Erika Ábrahám
2025	J	`jnl`	Finite-valued Streaming String Transducers. TheoretiCS Emmanuel Filiot, Ismaël Jecker, Gabriele Puppis, Christof Löding, Anca Muscholl, Sarah Winter
2025	J	`jnl`	Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning. CoRR Christof Löding, Igor Walukiewicz
2025	A*	`conf`	Minimal History-Deterministic Co-Büchi Automata: Congruences and Passive Learning. LICS Christof Löding, Igor Walukiewicz
2025	A*	`conf`	Saturation Problems for Families of Automata. ICALP León Bohn, Yong Li, Christof Löding, Sven Schewe
2025	J	`jnl`	Saturation Problems for Families of Automata. CoRR León Bohn, Yong Li, Christof Löding, Sven Schewe
2024	J	`jnl`	Constructing Deterministic Parity Automata from Positive and Negative Examples. TheoretiCS León Bohn, Christof Löding
2024	A*	`conf`	Finite-valued Streaming String Transducers. LICS Emmanuel Filiot, Ismaël Jecker, Christof Löding, Anca Muscholl, Gabriele Puppis, Sarah Winter
2024	J	`jnl`	Finite-valued Streaming String Transducers. CoRR Emmanuel Filiot, Ismaël Jecker, Gabriele Puppis, Christof Löding, Anca Muscholl, Sarah Winter
2024	J	`jnl`	On the Boolean Closure of Deterministic Top-Down Tree Automata. CoRR Christof Löding, Wolfgang Thomas
2024	J	`jnl`	On the Boolean Closure of Deterministic Top-Down Tree Automata. Int. J. Found. Comput. Sci. Christof Löding, Wolfgang Thomas
2023	J	`jnl`	A First-order Logic with Frames. ACM Trans. Program. Lang. Syst. Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan
2023	A	`conf`	A Regular and Complete Notion of Delay for Streaming String Transducers. STACS Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter
2023	J	`jnl`	Constructing Deterministic Parity Automata from Positive and Negative Examples. CoRR León Bohn, Christof Löding
2023	J	`jnl`	Resynchronized Uniformization and Definability Problems for Rational Relations. Discret. Math. Theor. Comput. Sci. Christof Löding, Sarah Winter
2022	J	`jnl`	A Regular and Complete Notion of Delay for Streaming String Transducers. CoRR Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter
2022	J	`jnl`	Minimization and Learning of Deterministic ω-Automata in the Presence of Don't Care Words. CoRR Christof Löding, Max Philip Stachon
2022	J	`jnl`	Model-guided synthesis of inductive lemmas for FOL with least fixpoints. Proc. ACM Program. Lang. Adithya Murali, Lucas Peña, Eion Blanchard, Christof Löding, P. Madhusudan
2022	J	`jnl`	On Minimization and Learning of Deterministic ω-Automata in the Presence of Don't Care Words. Fundam. Informaticae Christof Löding, Max Philip Stachon
2022	A*	`conf`	Passive Learning of Deterministic Büchi Automata by Combinations of DFAs. ICALP León Bohn, Christof Löding
2021	—	`ch.`	Automata on finite trees. Handbook of Automata Theory (I.) Christof Löding, Wolfgang Thomas
2021	—	`ch.`	Automata on infinite trees. Handbook of Automata Theory (I.) Christof Löding
2021	B	`conf`	Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm. MFCS León Bohn, Christof Löding
2021	J	`jnl`	Constructing deterministic ω-automata from examples by an extension of the RPNI algorithm. CoRR León Bohn, Christof Löding
2021	J	`jnl`	Resynchronized Uniformization and Definability Problems for Rational Relations. CoRR Christof Löding, Sarah Winter
2021	J	`jnl`	Synthesis from Weighted Specifications with Partial Domains over Finite Words. CoRR Emmanuel Filiot, Christof Löding, Sarah Winter
2020	A	`conf`	A First-Order Logic with Frames. ESOP Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan
2020	B	`conf`	Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. FoSSaCS Christof Löding, Anton Pirogov
2020	J	`jnl`	Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. CoRR Christof Löding, Anton Pirogov
2020	J	`jnl`	Projection for Büchi Tree Automata with Constraints between Siblings. Int. J. Found. Comput. Sci. Patrick Landwehr, Christof Löding
2020	B	`conf`	State Space Reduction For Parity Automata. CSL Christof Löding, Andreas Tollkötter
2020	—	`conf`	Synthesis from Weighted Specifications with Partial Domains over Finite Words. FSTTCS Emmanuel Filiot, Christof Löding, Sarah Winter
2020	J	`jnl`	Synthesizing Lemmas for Inductive Reasoning. CoRR Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan
2019	J	`jnl`	A First Order Logic with Frames. CoRR Christof Löding, P. Madhusudan, Adithya Murali, Lucas Peña
2019	J	`jnl`	Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. Discret. Math. Theor. Comput. Sci. Christof Löding, Christopher Spinrath
2019	A*	`conf`	Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. ICALP Christof Löding, Anton Pirogov
2019	J	`jnl`	Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. CoRR Christof Löding, Anton Pirogov
2019	B	`conf`	New Optimizations and Heuristics for Determinization of Büchi Automata. ATVA Christof Löding, Anton Pirogov
2019	J	`jnl`	New Optimizations and Heuristics for Determinization of Büchi Automata. CoRR Christof Löding, Anton Pirogov
2019	B	`conf`	New Pumping Technique for 2-Dimensional VASS. MFCS Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
2019	J	`jnl`	New Pumping Technique for 2-dimensional VASS. CoRR Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
2019	A	`conf`	Tree Automata with Global Constraints for Infinite Trees. STACS Patrick Landwehr, Christof Löding
2018	J	`jnl`	Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. CoRR Christof Löding, Christopher Spinrath
2018	J	`jnl`	Foundations for natural proofs and quantifier instantiation. Proc. ACM Program. Lang. Christof Löding, P. Madhusudan, Lucas Peña
2018	C	`conf`	On Finitely Ambiguous Büchi Automata. DLT Christof Löding, Anton Pirogov
2018	J	`jnl`	On finitely ambiguous Büchi automata. CoRR Christof Löding, Anton Pirogov
2018	C	`conf`	Projection for Büchi Tree Automata with Constraints Between Siblings. DLT Patrick Landwehr, Christof Löding
2018	J	`jnl`	Pure Strategies in Imperfect Information Stochastic Games. Fundam. Informaticae Arnaud Carayol, Christof Löding, Olivier Serre
2017	B	`conf`	Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. FCT Christof Löding, Christopher Spinrath
2017	J	`jnl`	Learning MSO-definable hypotheses on string. CoRR Martin Grohe, Christof Löding, Martin Ritzert
2017	B	`conf`	Learning MSO-definable hypotheses on strings. ALT Martin Grohe, Christof Löding, Martin Ritzert
2017	J	`jnl`	Synthesis of deterministic top-down tree transducers from automatic tree relations. Inf. Comput. Christof Löding, Sarah Winter
2016	A	`conf`	Abstract Learning Frameworks for Synthesis. TACAS Christof Löding, P. Madhusudan, Daniel Neider
2016	A*	`conf`	Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. LICS Arnaud Carayol, Christof Löding, Olivier Serre
2016	B	`ed.`	Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings FoSSaCS Bart Jacobs, Christof Löding
2016	A*	`conf`	On Equivalence and Uniformisation Problems for Finite Transducers. ICALP Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter
2016	J	`jnl`	On Equivalence and Uniformisation Problems for Finite Transducers. CoRR Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter
2016	B	`conf`	Transformation Between Regular Expressions and omega-Automata. MFCS Christof Löding, Andreas Tollkötter
2016	B	`conf`	Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers. MFCS Christof Löding, Sarah Winter
2015	B	`conf`	A Unified Approach to Boundedness Properties in MSO. CSL Lukasz Kaiser, Martin Lang, Simon Leßenich, Christof Löding
2015	J	`jnl`	Abstract Learning Frameworks for Synthesis. CoRR Christof Löding, P. Madhusudan, Daniel Neider
2015	J	`jnl`	Pure Strategies in Imperfect Information Stochastic Games. CoRR Arnaud Carayol, Christof Löding, Olivier Serre
2015	J	`jnl`	Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists. Formal Methods Syst. Des. Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider
2015	J	`jnl`	Simplification Problems for Deterministic Pushdown Automata on Infinite Words. Int. J. Found. Comput. Sci. Christof Löding
2014	—	`conf`	Decision Problems for Deterministic Pushdown Automata on Infinite Words. AFL Christof Löding
2014	—	`conf`	Definability and Transformations for Cost Logics and Automatic Structures. MFCS (1) Martin Lang, Christof Löding, Amaldev Manuel
2014	B	`conf`	Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games. MASS Simon Tenbusch, Christof Löding, Frank G. Radmacher, James Gross
2014	A*	`conf`	ICE: A Robust Framework for Learning Invariants. CAV Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider
2014	—	`conf`	Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations. GandALF Christof Löding, Sarah Winter
2013	—	`conf`	Decidability Results on the Existence of Lookahead Delegators for NFA. FSTTCS Christof Löding, Stefan Repke
2013	B	`conf`	Deciding the weak definability of Büchi definable tree languages. CSL Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom
2013	J	`jnl`	Learning Universally Quantified Invariants of Linear Data Structures CoRR Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider
2013	A*	`conf`	Learning Universally Quantified Invariants of Linear Data Structures. CAV Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider
2013	J	`jnl`	Modeling and Verification of Infinite Systems with Resources. Log. Methods Comput. Sci. Martin Lang, Christof Löding
2013	C	`conf`	Unambiguous Finite Automata. Developments in Language Theory Christof Löding
2012	—	`ch.`	Basics on Tree Automata. Modern Applications of Automata Theory Christof Löding
2012	J	`jnl`	Efficient inclusion testing for simple classes of unambiguous ω-automata. Inf. Process. Lett. Dimitri Isaak, Christof Löding
2012	B	`conf`	Improved Ramsey-Based Büchi Complementation. FoSSaCS Stefan Breuers, Christof Löding, Jörg Olschewski
2012	B	`conf`	Regularity Problems for Weak Pushdown ω-Automata and Games. MFCS Christof Löding, Stefan Repke
2011	B	`conf`	Degrees of Lookahead in Context-free Infinite Games. CSL Wladimir Fridman, Christof Löding, Martin Zimmermann
2011	—	`ch.`	Infinite games and automata theory. Lectures in Game Theory for Computer Scientists Christof Löding
2010	C	`conf`	Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. LATA Nicolas Bousquet, Christof Löding
2010	B	`conf`	Obliging Games. CONCUR Krishnendu Chatterjee, Florian Horn, Christof Löding
2010	A*	`conf`	Regular Cost Functions over Finite Trees. LICS Thomas Colcombet, Christof Löding
2009	—	`conf`	On Nondeterministic Unranked Tree Automata with Sibling Constraints. FSTTCS Christof Löding, Karianto Wong
2008	—	`conf`	Logical theories and compatible operations. Logic and Automata Achim Blumensath, Thomas Colcombet, Christof Löding
2008	B	`conf`	The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. CSL Thomas Colcombet, Christof Löding
2008	—	`conf`	The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. ICALP (2) Thomas Colcombet, Christof Löding
2007	B	`conf`	MSO on the Infinite Binary Tree: Choice and Order. CSL Arnaud Carayol, Christof Löding
2007	C	`conf`	Memory Reduction for Strategies in Infinite Games. CIAA Michael Holtmann, Christof Löding
2007	J	`jnl`	Propositional dynamic logic with recursive programs. J. Log. Algebraic Methods Program. Christof Löding, Carsten Lutz, Olivier Serre
2007	J	`jnl`	Transforming structures by set interpretations CoRR Thomas Colcombet, Christof Löding
2007	J	`jnl`	Transforming structures by set interpretations. Log. Methods Comput. Sci. Thomas Colcombet, Christof Löding
2007	B	`conf`	Transition Graphs of Rewriting Systems over Unranked Trees. MFCS Christof Löding, Alex Spelten
2007	A*	`conf`	Unranked Tree Automata with Sibling Equalities and Disequalities. ICALP Karianto Wong, Christof Löding
2006	J	`jnl`	A characterization of first-order topological properties of planar spatial data. J. ACM Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke
2006	B	`conf`	Propositional Dynamic Logic with Recursive Programs. FoSSaCS Christof Löding, Olivier Serre
2006	J	`jnl`	Reachability Problems on Regular Ground Tree Rewriting Graphs. Theory Comput. Syst. Christof Löding
2006	A	`conf`	Regularity Problems for Visibly Pushdown Languages. STACS Vince Bárány, Christof Löding, Olivier Serre
2005	—	`conf`	Deterministic Automata on Unranked Trees. Foundations of Semistructured Data Wolfgang Thomas, Julien Cristau, Christof Löding
2005	B	`conf`	Deterministic Automata on Unranked Trees. FCT Julien Cristau, Christof Löding, Wolfgang Thomas
2004	A*	`conf`	A Characterization of First-Order Topological Properties of Planar Spatial Data. PODS Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke
2004	A	`conf`	On the Expressiveness of Deterministic Transducers over Infinite Trees. STACS Thomas Colcombet, Christof Löding
2004	J	`jnl`	Synthesis of Open Reactive Systems from Scenario-Based Specifications. Fundam. Informaticae Yves Bontemps, Pierre-Yves Schobbens, Christof Löding
2004	—	`conf`	Visibly Pushdown Games. FSTTCS Christof Löding, P. Madhusudan, Olivier Serre
2003	—	`conf`	Model Checking and Satisfiability for Sabotage Modal Logic. FSTTCS Christof Löding, Philipp Rohde
2003	B	`conf`	Solving the Sabotage Game Is PSPACE-Hard. MFCS Christof Löding, Philipp Rohde
2002	A	`conf`	Ground Tree Rewriting Graphs of Bounded Tree Width. STACS Christof Löding
2002	B	`conf`	Model-Checking Infinite Systems Generated by Ground Tree Rewriting. FoSSaCS Christof Löding
2001	J	`jnl`	Efficient minimization of deterministic weak omega-automata. Inf. Process. Lett. Christof Löding
2000	—	`conf`	Alternating Automata and Logics over Infinite Words. IFIP TCS Christof Löding, Wolfgang Thomas
1999	—	`conf`	Optimal Bounds for Transformations of omega-Automata. FSTTCS Christof Löding