( en | de | ru )

 

Disambiguation of "Löding, Christof"

Author of the publication

copydeleteadd this publication to your clipboard
On Equivalence and Uniformisation Problems for Finite Transducers.

, , , and . ICALP, volume 55 of LIPIcs, page 125:1-125:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christof Löding

Ingrid Löding

Heinz Löding

Dörte Löding

Walter Löding

 

Other publications of authors with the same name

Reachability Problems on Regular Ground Tree Rewriting Graphs.. Theory Comput. Syst., 39 (2): 347-383 (2006)On Finitely Ambiguous Büchi Automata., and . DLT, volume 11088 of Lecture Notes in Computer Science, page 503-515. Springer, (2018)The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem., and . CSL, volume 5213 of Lecture Notes in Computer Science, page 416-430. Springer, (2008)Decision Problems for Deterministic Pushdown Automata on Infinite Words.. AFL, volume 151 of EPTCS, page 55-73. (2014)Minimization and Learning of Deterministic ω-Automata in the Presence of Don't Care Words., and . CoRR, (2022)On the Boolean Closure of Deterministic Top-Down Tree Automata., and . Int. J. Found. Comput. Sci., 35 (1&2): 11-22 (January 2024)Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata., and . FoSSaCS, volume 12077 of Lecture Notes in Computer Science, page 522-541. Springer, (2020)Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm., and . MFCS, volume 202 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Regular Cost Functions over Finite Trees., and . LICS, page 70-79. IEEE Computer Society, (2010)Learning MSO-definable hypotheses on strings., , and . ALT, volume 76 of Proceedings of Machine Learning Research, page 434-451. PMLR, (2017)