Andreea-Teodora Nász

According to our database, Andreea-Teodora Nász authored at least 7 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Weighing in on the HOM-Problem: A Study of Weighted Tree Automata and Homomorphisms

Andreea-Teodora Nász

PhD thesis, 2024

Weighted HOM-Problem for Nonnegative Integers.

Andreas Maletti, Andreea-Teodora Nász, Erik Paul

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

The Weighted HOM-Problem Over Fields.

Andreea-Teodora Nász

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

Solving the Weighted HOM-Problem With the Help of Unambiguity.

Andreea-Teodora Nász

Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable.

Andreas Maletti, Andreea-Teodora Nász

Proceedings of the Implementation and Application of Automata, 2023

2022

Weighted Tree Automata with Constraints.

Andreas Maletti, Andreea-Teodora Nász

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

Ambiguity Hierarchies for Weighted Tree Automata.

Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht

Proceedings of the Implementation and Application of Automata, 2021