| Crisp-determinization of weighted tree automata over strong bimonoids Z Fülöp, D Kószó, H Vogler Discrete Mathematics & Theoretical Computer Science 23 (1), 2021 | 11 | 2021 |
| Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable M Droste, Z Fülöp, D Kószó, H Vogler Descriptional Complexity of Formal Systems: 22nd International Conference …, 2020 | 6 | 2020 |
| Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids M Droste, Z Fülöp, D Kószó, H Vogler Theoretical Computer Science 919, 118-143, 2022 | 5 | 2022 |
| Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata M Droste, Z Fülöp, D Kószó International Journal of Foundations of Computer Science 34 (06), 633-653, 2023 | 1 | 2023 |
| Tree generating context-free grammars and regular tree grammars are equivalent D Kószó Annales Mathematicae et Informaticae 56, 58-70, 2022 | 1 | 2022 |
| Weighted Tree Generating Regular Systems over Strong Bimonoids with Reduction Semantics D Kószó Journal of Automata, Languages and Combinatorics 27 (4), 271–307, 2022 | | 2022 |
| Online Scheduling with Machine Cost and a Quadratic Objective Function J Csirik, G Dósa, D Kószó SOFSEM 2020: Theory and Practice of Computer Science: 46th International …, 2020 | | 2020 |
| Weighted Tree Generating Regular Systems and Crisp-Determinization of Weighted Tree Automata D Kószó | | |
Z FülöpProfessor of Computer Science, University of SzegedVerified email at inf.u-szeged.hu
Z FülöpProfessor of Computer Science, University of SzegedVerified email at inf.u-szeged.hu