Author of the publication

On Finite and Polynomial Ambiguity of Weighted Tree Automata.

. DLT, volume 9840 of Lecture Notes in Computer Science, page 368-379. Springer, (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.

 

Other publications of authors with the same name

Expressiveness and Decidability of Weighted Automata and Weighted Logics.. Leipzig University, Germany, (2020)The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable.. MFCS, volume 83 of LIPIcs, page 53:1-53:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Weighted HOM-Problem for Nonnegative Integers., , and . STACS, volume 289 of LIPIcs, page 51:1-51:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Logical Characterizations of Weighted Complexity Classes., , , and . MFCS, volume 306 of LIPIcs, page 14:1-14:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Monitor Logics for Quantitative Monitor Automata.. MFCS, volume 83 of LIPIcs, page 14:1-14:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic., and . MFCS, volume 117 of LIPIcs, page 76:1-76:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Finite Sequentiality of Unambiguous Max-Plus Tree Automata.. STACS, volume 126 of LIPIcs, page 55:1-55:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On Finite and Polynomial Ambiguity of Weighted Tree Automata.. DLT, volume 9840 of Lecture Notes in Computer Science, page 368-379. Springer, (2016)Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata.. ICALP, volume 168 of LIPIcs, page 137:1-137:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata.. Theory Comput. Syst., 68 (4): 615-661 (August 2024)