default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristof Löding
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j20]Christof Löding, Wolfgang Thomas:
On the Boolean Closure of Deterministic Top-Down Tree Automata. Int. J. Found. Comput. Sci. 35(1&2): 11-22 (2024)- [j19]León Bohn, Christof Löding:
Constructing Deterministic Parity Automata from Positive and Negative Examples. TheoretiCS 3 (2024) - 2023
- [j18]Adithya Murali
, Lucas Peña, Christof Löding, P. Madhusudan:
A First-order Logic with Frames. ACM Trans. Program. Lang. Syst. 45(2): 7:1-7:44 (2023) - 2022
- [j17]Christof Löding, Max Philip Stachon:
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don't Care Words. Fundam. Informaticae 189(1): 69-91 (2022) - [j16]Adithya Murali, Lucas Peña, Eion Blanchard, Christof Löding, P. Madhusudan:
Model-guided synthesis of inductive lemmas for FOL with least fixpoints. Proc. ACM Program. Lang. 6(OOPSLA2): 1873-1902 (2022) - 2020
- [j15]Patrick Landwehr, Christof Löding:
Projection for Büchi Tree Automata with Constraints between Siblings. Int. J. Found. Comput. Sci. 31(6): 749-775 (2020) - 2019
- [j14]Christof Löding, Christopher Spinrath:
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2018
- [j13]Arnaud Carayol, Christof Löding, Olivier Serre:
Pure Strategies in Imperfect Information Stochastic Games. Fundam. Informaticae 160(4): 361-384 (2018) - [j12]Christof Löding, P. Madhusudan, Lucas Peña:
Foundations for natural proofs and quantifier instantiation. Proc. ACM Program. Lang. 2(POPL): 10:1-10:30 (2018) - 2017
- [j11]Christof Löding, Sarah Winter:
Synthesis of deterministic top-down tree transducers from automatic tree relations. Inf. Comput. 253: 336-354 (2017) - 2015
- [j10]Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider:
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. 47(1): 120-157 (2015) - [j9]Christof Löding:
Simplification Problems for Deterministic Pushdown Automata on Infinite Words. Int. J. Found. Comput. Sci. 26(8): 1041-1068 (2015) - 2013
- [j8]Martin Lang, Christof Löding:
Modeling and Verification of Infinite Systems with Resources. Log. Methods Comput. Sci. 9(4) (2013) - 2012
- [j7]Dimitri Isaak, Christof Löding:
Efficient inclusion testing for simple classes of unambiguous ω-automata. Inf. Process. Lett. 112(14-15): 578-582 (2012) - 2007
- [j6]Christof Löding, Carsten Lutz, Olivier Serre:
Propositional dynamic logic with recursive programs. J. Log. Algebraic Methods Program. 73(1-2): 51-69 (2007) - [j5]Thomas Colcombet, Christof Löding:
Transforming structures by set interpretations. Log. Methods Comput. Sci. 3(2) (2007) - 2006
- [j4]Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke:
A characterization of first-order topological properties of planar spatial data. J. ACM 53(2): 273-305 (2006) - [j3]Christof Löding:
Reachability Problems on Regular Ground Tree Rewriting Graphs. Theory Comput. Syst. 39(2): 347-383 (2006) - 2004
- [j2]Yves Bontemps, Pierre-Yves Schobbens, Christof Löding:
Synthesis of Open Reactive Systems from Scenario-Based Specifications. Fundam. Informaticae 62(2): 139-169 (2004) - 2001
- [j1]Christof Löding:
Efficient minimization of deterministic weak omega-automata. Inf. Process. Lett. 79(3): 105-109 (2001)
Conference and Workshop Papers
- 2024
- [c57]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Anca Muscholl, Gabriele Puppis, Sarah Winter:
Finite-valued Streaming String Transducers. LICS 2024: 33:1-33:14 - 2023
- [c56]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
A Regular and Complete Notion of Delay for Streaming String Transducers. STACS 2023: 32:1-32:16 - 2022
- [c55]León Bohn, Christof Löding:
Passive Learning of Deterministic Büchi Automata by Combinations of DFAs. ICALP 2022: 114:1-114:20 - 2021
- [c54]León Bohn, Christof Löding:
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm. MFCS 2021: 20:1-20:18 - 2020
- [c53]Christof Löding, Andreas Tollkötter:
State Space Reduction For Parity Automata. CSL 2020: 27:1-27:16 - [c52]Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan:
A First-Order Logic with Frames. ESOP 2020: 515-543 - [c51]Christof Löding, Anton Pirogov:
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. FoSSaCS 2020: 522-541 - [c50]Emmanuel Filiot, Christof Löding, Sarah Winter:
Synthesis from Weighted Specifications with Partial Domains over Finite Words. FSTTCS 2020: 46:1-46:16 - 2019
- [c49]Christof Löding, Anton Pirogov:
New Optimizations and Heuristics for Determinization of Büchi Automata. ATVA 2019: 317-333 - [c48]Christof Löding, Anton Pirogov:
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. ICALP 2019: 120:1-120:13 - [c47]Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski:
New Pumping Technique for 2-Dimensional VASS. MFCS 2019: 62:1-62:14 - [c46]Patrick Landwehr, Christof Löding:
Tree Automata with Global Constraints for Infinite Trees. STACS 2019: 47:1-47:15 - 2018
- [c45]Patrick Landwehr, Christof Löding:
Projection for Büchi Tree Automata with Constraints Between Siblings. DLT 2018: 478-490 - [c44]Christof Löding, Anton Pirogov:
On Finitely Ambiguous Büchi Automata. DLT 2018: 503-515 - 2017
- [c43]Martin Grohe, Christof Löding, Martin Ritzert:
Learning MSO-definable hypotheses on strings. ALT 2017: 434-451 - [c42]Christof Löding, Christopher Spinrath:
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. FCT 2017: 341-354 - 2016
- [c41]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
On Equivalence and Uniformisation Problems for Finite Transducers. ICALP 2016: 125:1-125:14 - [c40]Arnaud Carayol, Christof Löding, Olivier Serre:
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. LICS 2016: 227-236 - [c39]Christof Löding, Sarah Winter:
Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers. MFCS 2016: 65:1-65:14 - [c38]Christof Löding, Andreas Tollkötter:
Transformation Between Regular Expressions and omega-Automata. MFCS 2016: 88:1-88:13 - [c37]Christof Löding, P. Madhusudan, Daniel Neider:
Abstract Learning Frameworks for Synthesis. TACAS 2016: 167-185 - 2015
- [c36]Lukasz Kaiser, Martin Lang, Simon Leßenich, Christof Löding:
A Unified Approach to Boundedness Properties in MSO. CSL 2015: 441-456 - 2014
- [c35]Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider:
ICE: A Robust Framework for Learning Invariants. CAV 2014: 69-87 - [c34]Simon Tenbusch, Christof Löding, Frank G. Radmacher, James Gross:
Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games. MASS 2014: 461-469 - [c33]Martin Lang, Christof Löding, Amaldev Manuel:
Definability and Transformations for Cost Logics and Automatic Structures. MFCS (1) 2014: 390-401 - [c32]Christof Löding:
Decision Problems for Deterministic Pushdown Automata on Infinite Words. AFL 2014: 55-73 - [c31]Christof Löding, Sarah Winter:
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations. GandALF 2014: 88-101 - 2013
- [c30]Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider:
Learning Universally Quantified Invariants of Linear Data Structures. CAV 2013: 813-829 - [c29]Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom:
Deciding the weak definability of Büchi definable tree languages. CSL 2013: 215-230 - [c28]Christof Löding:
Unambiguous Finite Automata. Developments in Language Theory 2013: 29-30 - [c27]Christof Löding, Stefan Repke:
Decidability Results on the Existence of Lookahead Delegators for NFA. FSTTCS 2013: 327-338 - 2012
- [c26]Stefan Breuers, Christof Löding, Jörg Olschewski:
Improved Ramsey-Based Büchi Complementation. FoSSaCS 2012: 150-164 - [c25]Christof Löding, Stefan Repke:
Regularity Problems for Weak Pushdown ω-Automata and Games. MFCS 2012: 764-776 - 2011
- [c24]Wladimir Fridman, Christof Löding, Martin Zimmermann:
Degrees of Lookahead in Context-free Infinite Games. CSL 2011: 264-276 - 2010
- [c23]Krishnendu Chatterjee, Florian Horn, Christof Löding:
Obliging Games. CONCUR 2010: 284-296 - [c22]Nicolas Bousquet, Christof Löding:
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. LATA 2010: 118-129 - [c21]Thomas Colcombet, Christof Löding:
Regular Cost Functions over Finite Trees. LICS 2010: 70-79 - 2009
- [c20]Christof Löding, Karianto Wong:
On Nondeterministic Unranked Tree Automata with Sibling Constraints. FSTTCS 2009: 311-322 - 2008
- [c19]Achim Blumensath, Thomas Colcombet, Christof Löding:
Logical theories and compatible operations. Logic and Automata 2008: 73-106 - [c18]Thomas Colcombet, Christof Löding:
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. CSL 2008: 416-430 - [c17]Thomas Colcombet, Christof Löding:
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. ICALP (2) 2008: 398-409 - 2007
- [c16]Arnaud Carayol, Christof Löding:
MSO on the Infinite Binary Tree: Choice and Order. CSL 2007: 161-176 - [c15]Karianto Wong, Christof Löding:
Unranked Tree Automata with Sibling Equalities and Disequalities. ICALP 2007: 875-887 - [c14]Christof Löding, Alex Spelten:
Transition Graphs of Rewriting Systems over Unranked Trees. MFCS 2007: 67-77 - [c13]Michael Holtmann, Christof Löding:
Memory Reduction for Strategies in Infinite Games. CIAA 2007: 253-264 - 2006
- [c12]Christof Löding, Olivier Serre:
Propositional Dynamic Logic with Recursive Programs. FoSSaCS 2006: 292-306 - [c11]Vince Bárány, Christof Löding, Olivier Serre:
Regularity Problems for Visibly Pushdown Languages. STACS 2006: 420-431 - 2005
- [c10]Julien Cristau, Christof Löding, Wolfgang Thomas:
Deterministic Automata on Unranked Trees. FCT 2005: 68-79 - 2004
- [c9]Christof Löding, P. Madhusudan, Olivier Serre:
Visibly Pushdown Games. FSTTCS 2004: 408-420 - [c8]Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke:
A Characterization of First-Order Topological Properties of Planar Spatial Data. PODS 2004: 107-114 - [c7]Thomas Colcombet, Christof Löding:
On the Expressiveness of Deterministic Transducers over Infinite Trees. STACS 2004: 428-439 - 2003
- [c6]Christof Löding, Philipp Rohde:
Model Checking and Satisfiability for Sabotage Modal Logic. FSTTCS 2003: 302-313 - [c5]Christof Löding, Philipp Rohde:
Solving the Sabotage Game Is PSPACE-Hard. MFCS 2003: 531-540 - 2002
- [c4]Christof Löding:
Model-Checking Infinite Systems Generated by Ground Tree Rewriting. FoSSaCS 2002: 280-294 - [c3]Christof Löding:
Ground Tree Rewriting Graphs of Bounded Tree Width. STACS 2002: 559-570 - 2000
- [c2]Christof Löding, Wolfgang Thomas:
Alternating Automata and Logics over Infinite Words. IFIP TCS 2000: 521-535 - 1999
- [c1]Christof Löding:
Optimal Bounds for Transformations of omega-Automata. FSTTCS 1999: 97-109
Parts in Books or Collections
- 2021
- [p4]Christof Löding, Wolfgang Thomas:
Automata on finite trees. Handbook of Automata Theory (I.) 2021: 235-264 - [p3]Christof Löding:
Automata on infinite trees. Handbook of Automata Theory (I.) 2021: 265-302 - 2012
- [p2]Christof Löding:
Basics on Tree Automata. Modern Applications of Automata Theory 2012: 79-110 - 2011
- [p1]Christof Löding:
Infinite games and automata theory. Lectures in Game Theory for Computer Scientists 2011: 38-73
Editorship
- 2016
- [e1]Bart Jacobs, Christof Löding:
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. Lecture Notes in Computer Science 9634, Springer 2016, ISBN 978-3-662-49629-9 [contents]
Informal and Other Publications
- 2024
- [i23]Christof Löding, Wolfgang Thomas:
On the Boolean Closure of Deterministic Top-Down Tree Automata. CoRR abs/2401.06596 (2024) - [i22]Emmanuel Filiot, Ismaël Jecker, Gabriele Puppis, Christof Löding, Anca Muscholl, Sarah Winter:
Finite-valued Streaming String Transducers. CoRR abs/2405.08171 (2024) - 2023
- [i21]León Bohn, Christof Löding:
Constructing Deterministic Parity Automata from Positive and Negative Examples. CoRR abs/2302.11043 (2023) - 2022
- [i20]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
A Regular and Complete Notion of Delay for Streaming String Transducers. CoRR abs/2205.04287 (2022) - [i19]Christof Löding, Max Philip Stachon:
Minimization and Learning of Deterministic ω-Automata in the Presence of Don't Care Words. CoRR abs/2211.08787 (2022) - 2021
- [i18]Emmanuel Filiot, Christof Löding, Sarah Winter:
Synthesis from Weighted Specifications with Partial Domains over Finite Words. CoRR abs/2103.05550 (2021) - [i17]Christof Löding, Sarah Winter:
Resynchronized Uniformization and Definability Problems for Rational Relations. CoRR abs/2104.12508 (2021) - [i16]León Bohn, Christof Löding:
Constructing deterministic ω-automata from examples by an extension of the RPNI algorithm. CoRR abs/2108.03735 (2021) - 2020
- [i15]Christof Löding, Anton Pirogov:
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. CoRR abs/2004.13692 (2020) - [i14]Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan:
Synthesizing Lemmas for Inductive Reasoning. CoRR abs/2009.10207 (2020) - 2019
- [i13]Christof Löding, P. Madhusudan, Adithya Murali, Lucas Peña:
A First Order Logic with Frames. CoRR abs/1901.09089 (2019) - [i12]Christof Löding, Anton Pirogov:
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. CoRR abs/1902.02139 (2019) - [i11]Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski:
New Pumping Technique for 2-dimensional VASS. CoRR abs/1906.10494 (2019) - [i10]Christof Löding, Anton Pirogov:
New Optimizations and Heuristics for Determinization of Büchi Automata. CoRR abs/1911.01759 (2019) - 2018
- [i9]Christof Löding, Christopher Spinrath:
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. CoRR abs/1803.06140 (2018) - [i8]Christof Löding, Anton Pirogov:
On finitely ambiguous Büchi automata. CoRR abs/1809.09415 (2018) - 2017
- [i7]Martin Grohe, Christof Löding, Martin Ritzert:
Learning MSO-definable hypotheses on string. CoRR abs/1708.08081 (2017) - 2016
- [i6]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
On Equivalence and Uniformisation Problems for Finite Transducers. CoRR abs/1602.08565 (2016) - 2015
- [i5]Arnaud Carayol, Christof Löding, Olivier Serre:
Pure Strategies in Imperfect Information Stochastic Games. CoRR abs/1506.09140 (2015) - [i4]Christof Löding, P. Madhusudan, Daniel Neider:
Abstract Learning Frameworks for Synthesis. CoRR abs/1507.05612 (2015) - 2013
- [i3]Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider:
Learning Universally Quantified Invariants of Linear Data Structures. CoRR abs/1302.2273 (2013) - 2007
- [i2]Thomas Colcombet, Christof Löding:
Transforming structures by set interpretations. CoRR abs/cs/0703039 (2007) - 2005
- [i1]Wolfgang Thomas, Julien Cristau, Christof Löding:
Deterministic Automata on Unranked Trees. Foundations of Semistructured Data 2005
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-11 00:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
