Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable

Manfred Droste, Zoltán Fülöp 0001, Dávid Kószó, Heiko Vogler. Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. In Galina Jirásková, Giovanni Pighizzini, editors, Descriptional Complexity of Formal Systems - 22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020, Proceedings. Volume 12442 of Lecture Notes in Computer Science, pages 39-51, Springer, 2020. [doi]

Abstract

Abstract is missing.