Person:436609: Difference between revisions

From MaRDI portal
Person:436609
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Christof Löding to Christof Löding: Duplicate
 
(No difference)

Latest revision as of 21:51, 11 December 2023

Available identifiers

zbMath Open loding.christofDBLPl/ChristofLodingWikidataQ102264595 ScholiaQ102264595MaRDI QIDQ436609

List of research outcomes





PublicationDate of PublicationType
A regular and complete notion of delay for streaming string transducers2024-10-08Paper
Resynchronized uniformization and definability problems for rational relations2024-09-06Paper
Constructing deterministic parity automata from positive and negative examples2024-08-13Paper
Passive learning of deterministic Büchi automata by combinations of DFAs2024-06-24Paper
On the Boolean Closure of Deterministic Top-Down Tree Automata2024-02-16Paper
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words2023-09-14Paper
https://portal.mardi4nfdi.de/entity/Q61684322023-08-08Paper
https://portal.mardi4nfdi.de/entity/Q58742142023-02-07Paper
A First-Order Logic with Frames2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q50923212022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924252022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50904982022-07-18Paper
Automata on finite trees2022-02-04Paper
Automata on infinite trees2022-02-04Paper
https://portal.mardi4nfdi.de/entity/Q49953612021-06-24Paper
https://portal.mardi4nfdi.de/entity/Q49949352021-06-22Paper
Projection for Büchi Tree Automata with Constraints between Siblings2021-04-19Paper
Ambiguity, weakness, and regularity in probabilistic Büchi automata2020-09-23Paper
New Optimizations and Heuristics for Determinization of Büchi Automata2020-07-20Paper
https://portal.mardi4nfdi.de/entity/Q53772262019-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46456602019-01-10Paper
Projection for Büchi tree automata with constraints between siblings2018-11-22Paper
On finitely ambiguous Büchi automata2018-11-22Paper
Pure Strategies in Imperfect Information Stochastic Games2018-10-26Paper
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings2018-04-23Paper
Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers2018-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46086522018-03-21Paper
On equivalence and uniformisation problems for finite transducers2017-12-19Paper
Decision problems for subclasses of rational relations over finite and infinite words2017-11-22Paper
https://portal.mardi4nfdi.de/entity/Q53519732017-08-31Paper
https://portal.mardi4nfdi.de/entity/Q52714162017-07-11Paper
Synthesis of deterministic top-down tree transducers from automatic tree relations2017-03-16Paper
Decidability Results on the Existence of Lookahead Delegators for NFA2017-02-21Paper
https://portal.mardi4nfdi.de/entity/Q29585242017-02-02Paper
Simplification Problems for Deterministic Pushdown Automata on Infinite Words2016-04-15Paper
Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists2015-10-20Paper
Definability and Transformations for Cost Logics and Automatic Structures2014-10-14Paper
Modeling and Verification of Infinite Systems with Resources2014-01-08Paper
Basics on Tree Automata2013-02-26Paper
https://portal.mardi4nfdi.de/entity/Q29201392012-10-24Paper
Regularity Problems for Weak Pushdown ω-Automata and Games2012-09-25Paper
Degrees of Lookahead in Context-free Infinite Games2012-09-18Paper
Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata2012-07-25Paper
Improved Ramsey-Based Büchi Complementation2012-06-22Paper
https://portal.mardi4nfdi.de/entity/Q31725282011-10-05Paper
https://portal.mardi4nfdi.de/entity/Q30869202011-03-30Paper
Choice functions and well-orderings over the infinite binary tree2010-11-22Paper
Obliging Games2010-08-31Paper
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata2010-05-26Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science2009-08-06Paper
MSO on the Infinite Binary Tree: Choice and Order2009-03-05Paper
A characterization of first-order topological properties of planar spatial data2008-12-21Paper
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem2008-11-20Paper
Transition Graphs of Rewriting Systems over Unranked Trees2008-09-17Paper
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata2008-08-19Paper
Memory Reduction for Strategies in Infinite Games2008-06-10Paper
Regularity Problems for Visibly Pushdown Languages2008-03-19Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Unranked Tree Automata with Sibling Equalities and Disequalities2007-11-28Paper
Transforming structures by set interpretations2007-10-11Paper
STACS 20042007-10-01Paper
Propositional dynamic logic with recursive programs2007-08-23Paper
Foundations of Software Science and Computation Structures2007-05-02Paper
Reachability problems on regular ground tree rewriting graphs2006-10-25Paper
Fundamentals of Computation Theory2006-10-20Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48244782004-11-01Paper
https://portal.mardi4nfdi.de/entity/Q47368712004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47382322004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q45364462002-11-25Paper
Efficient minimization of deterministic weak \(\omega\)-automata2002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q45016652000-11-07Paper

Research outcomes over time

This page was built for person: Christof Löding