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 001; Dávid Kószó; Heiko Vogler (DCFS, 2020)

Online Scheduling with Machine Cost and a Quadratic Objective Function. - János Csirik; György Dósa; Dávid Kószó (SOFSEM, 2020)

Crisp-determinization of weighted tree automata over strong bimonoids. - Zoltán Fülöp 001; Dávid Kószó; Heiko Vogler (Discret. Math. Theor. Comput. Sci., 2021)

Weighted Tree Generating Regular Systems over Strong Bimonoids with Reduction Semantics. - Dávid Kószó (J. Autom. Lang. Comb., 2022)

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. - Manfred Droste; Zoltán Fülöp 001; Dávid Kószó; Heiko Vogler (Theor. Comput. Sci., 2022)

Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata. - Manfred Droste; Zoltán Fülöp 001; Dávid Kószó (Int. J. Found. Comput. Sci., 2023)