Linear weighted tree automata with storage and inverse linear tree homomorphisms
From International Center for Computational Logic
Linear weighted tree automata with storage and inverse linear tree homomorphisms
Luisa HerrmannLuisa Herrmann
Luisa Herrmann
Linear weighted tree automata with storage and inverse linear tree homomorphisms
Information and Computation, 281, 2021
Linear weighted tree automata with storage and inverse linear tree homomorphisms
Information and Computation, 281, 2021
- KurzfassungAbstract
We introduce linear weighted tree automata with storage and show that this model generalizes linear pushdown tree automata. We prove that the class of weighted tree languages recognizable by our linear automaton model is closed under inverse linear tree homomorphisms. - Weitere Informationen unter:Further Information: Link
- Projekt:Project: QuantLA
- Forschungsgruppe:Research Group: Computational LogicComputational Logic
@article{H2021,
author = {Luisa Herrmann},
title = {Linear weighted tree automata with storage and inverse linear
tree homomorphisms},
journal = {Information and Computation},
volume = {281},
publisher = {Elsevier},
year = {2021},
doi = {https://doi.org/10.1016/j.ic.2021.104816}
}