The following pages link to Christof Löding (Q436609):
Displaying 50 items.
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata (Q436610) (← links)
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists (Q746778) (← links)
- (Q1603451) (redirect page) (← links)
- Efficient minimization of deterministic weak \(\omega\)-automata (Q1603452) (← links)
- Projection for Büchi tree automata with constraints between siblings (Q1622997) (← links)
- On finitely ambiguous Büchi automata (Q1623000) (← links)
- Decision problems for subclasses of rational relations over finite and infinite words (Q1679989) (← links)
- Automata on finite trees (Q2074209) (← links)
- Automata on infinite trees (Q2074210) (← links)
- Ambiguity, weakness, and regularity in probabilistic Büchi automata (Q2200844) (← links)
- Reachability problems on regular ground tree rewriting graphs (Q2432538) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- Simplification Problems for Deterministic Pushdown Automata on Infinite Words (Q2800412) (← links)
- Modeling and Verification of Infinite Systems with Resources (Q2871475) (← links)
- Improved Ramsey-Based Büchi Complementation (Q2892768) (← links)
- Regularity Problems for Weak Pushdown ω-Automata and Games (Q2912775) (← links)
- Degrees of Lookahead in Context-free Infinite Games (Q2915687) (← links)
- (Q2920139) (← links)
- Definability and Transformations for Cost Logics and Automatic Structures (Q2922032) (← links)
- (Q2958524) (← links)
- Decidability Results on the Existence of Lookahead Delegators for NFA (Q2963924) (← links)
- (Q3086920) (← links)
- (Q3172528) (← links)
- New Optimizations and Heuristics for Determinization of Büchi Automata (Q3297598) (← links)
- Memory Reduction for Strategies in Infinite Games (Q3503911) (← links)
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (Q3519517) (← links)
- Transition Graphs of Rewriting Systems over Unranked Trees (Q3525557) (← links)
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194) (← links)
- A characterization of first-order topological properties of planar spatial data (Q3546315) (← links)
- Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata (Q3564854) (← links)
- Obliging Games (Q3584937) (← links)
- MSO on the Infinite Binary Tree: Choice and Order (Q3608411) (← links)
- (Q4501665) (← links)
- (Q4536446) (← links)
- On equivalence and uniformisation problems for finite transducers (Q4598267) (← links)
- Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers (Q4608628) (← links)
- (Q4608652) (← links)
- Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings (Q4635878) (← links)
- (Q4645660) (← links)
- Pure Strategies in Imperfect Information Stochastic Games (Q4692115) (← links)
- (Q4736871) (← links)
- (Q4738232) (← links)
- (Q4824478) (← links)
- Basics on Tree Automata (Q4907855) (← links)
- (Q4994935) (← links)
- (Q4995361) (← links)
- A First-Order Logic with Frames (Q5041109) (← links)
- (Q5090498) (← links)
