%P 39-51
%T Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable
%C Cham
%L publicatio36191
%I Springer International Publishing
%N 12442
%R MTMT:31669354 10.1007/978-3-030-62536-8_4
%A  Droste Manfred
%A  FĂźlĂśp ZoltĂĄn
%A  KĂłszĂł DĂĄvid
%A  Vogler Heiko
%D 2020
%S Lecture Notes in Computer Science
%B Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020