Szerző: " Kószó Dávid"

Kószó Dávid; Aladics Tamás; Ferenc Rudolf; Hegedűs Péter: A Large-Scale Collection Of (Non-)Actionable Static Code Analysis Reports.
SCIENTIFIC DATA, 12 (1). ISSN 2052-4463 (2025)

Droste Manfred; Fülöp Zoltán; Kószó Dávid: Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 34 (6). pp. 633-653. ISSN 0129-0541 (2023)

Droste Manfred; Fülöp Zoltán; Kószó Dávid; Vogler Heiko: Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids.
THEORETICAL COMPUTER SCIENCE, 919. pp. 118-143. ISSN 0304-3975 (2022)

Kószó Dávid: Tree generating context-free grammars and regular tree grammars are equivalent.
ANNALES MATHEMATICAE ET INFORMATICAE, 56. pp. 58-70. ISSN 1787-5021 (2022)

Kószó Dávid: Weighted Tree Generating Regular Systems over Strong Bimonoids with Reduction Semantics.
JOURNAL OF AUTOMATA, LANGUAGES AND COMBINATORICS, 27 (4). pp. 271-307. ISSN 1430-189X (2022)

Fülöp Zoltán; Kószó Dávid; Vogler Heiko: Crisp-determinization of weighted tree automata over strong bimonoids.
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 23 (1). ISSN 1462-7264 (2021)

Droste Manfred; Fülöp Zoltán; Kószó Dávid; Vogler Heiko: Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable.
In: Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020. Lecture Notes in Computer Science (12442). Springer International Publishing, Cham, pp. 39-51. (2020) ISBN 9783030625368; 9783030625351

Csirik János; Dósa György; Kószó Dávid: Online Scheduling with Machine Cost and a Quadratic Objective Function.
In: SOFSEM 2020: Theory and Practice of Computer Science. Lecture Notes in Computer Science (12011). Springer Netherlands, Cham, pp. 199-210. (2020) ISBN 9783030389192; 9783030389185