Andreea-Teodora Nász

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2023
2024
2025
0
1
2
3
4
1
1
1
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
The weighted HOM-problem over fields.
J. Comput. Syst. Sci., 2025

2024
Weighted Tree Automata with Constraints.
Theory Comput. Syst., February, 2024

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

Weighted HOM-Problem for Nonnegative Integers.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023
Ambiguity Hierarchies for Weighted Tree Automata.
Int. J. Found. Comput. Sci., December, 2023

Solving the Weighted HOM-Problem With the Help of Unambiguity.
Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable.
Proceedings of the Implementation and Application of Automata, 2023


  Loading...