Weighted tree automata with constraints A Maletti, AT Nász Theory of Computing Systems 68 (1), 1-28, 2024 | 7 | 2024 |
Solving the weighted HOM-problem with the help of unambiguity AT Nász arXiv preprint arXiv:2309.02761, 2023 | 4 | 2023 |
Weighted HOM-problem for nonnegative integers A Maletti, AT Nász, E Paul arXiv preprint arXiv:2305.04117, 2023 | 3 | 2023 |
The Weighted HOM-Problem Over Fields AT Nász International Conference on Current Trends in Theory and Practice of …, 2024 | | 2024 |
Faculty of Mathematics and Computer Science, Universität Leipzig, PO box 100 920, 04009 Leipzig, Germany nasz@ informatik. uni-leipzig. de AT Nász SOFSEM 2024: Theory and Practice of Computer Science: 49th International …, 2024 | | 2024 |
Ambiguity Hierarchies for Weighted Tree Automata A Maletti, T Nasz, K Stier, M Ulbricht International Journal of Foundations of Computer Science 34 (08), 903-921, 2023 | | 2023 |
Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable A Maletti, AT Nász International Conference on Implementation and Application of Automata, 218-229, 2023 | | 2023 |
Weighing in on the HOM-Problem AT Nász | | |