Andreea-Teodora Nász

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

Collaborative distances:

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

2025

The weighted HOM-problem over fields.

Andreea-Teodora Nász

J. Comput. Syst. Sci., 2025

2024

Weighted Tree Automata with Constraints.

Andreas Maletti, Andreea-Teodora Nász

Theory Comput. Syst., February, 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

2023

Ambiguity Hierarchies for Weighted Tree Automata.

Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht

Int. J. Found. Comput. Sci., December, 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