( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations.

, и . GandALF, том 161 из EPTCS, стр. 88-101. (2014)

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.

Christof Löding

Ingrid Löding

Heinz Löding

Dörte Löding

Walter Löding

 

Другие публикации лиц с тем же именем

Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata., и . FoSSaCS, том 12077 из Lecture Notes in Computer Science, стр. 522-541. Springer, (2020)Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm., и . MFCS, том 202 из LIPIcs, стр. 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Reachability Problems on Regular Ground Tree Rewriting Graphs.. Theory Comput. Syst., 39 (2): 347-383 (2006)The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem., и . CSL, том 5213 из Lecture Notes in Computer Science, стр. 416-430. Springer, (2008)Decision Problems for Deterministic Pushdown Automata on Infinite Words.. AFL, том 151 из EPTCS, стр. 55-73. (2014)On Finitely Ambiguous Büchi Automata., и . DLT, том 11088 из Lecture Notes in Computer Science, стр. 503-515. Springer, (2018)On the Boolean Closure of Deterministic Top-Down Tree Automata., и . Int. J. Found. Comput. Sci., 35 (1&2): 11-22 (января 2024)Minimization and Learning of Deterministic ω-Automata in the Presence of Don't Care Words., и . CoRR, (2022)Regular Cost Functions over Finite Trees., и . LICS, стр. 70-79. IEEE Computer Society, (2010)Model-guided synthesis of inductive lemmas for FOL with least fixpoints., , , , и . Proc. ACM Program. Lang., 6 (OOPSLA2): 1873-1902 (2022)