Article3082: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Luisa Herrmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Luisa |ErsterAutorNachname=Herrmann }} {{Article |Referiert=1 |Title=Linear weighted tree automata with storage…“) |
Luisa Herrmann (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 14: | Zeile 14: | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=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. | |Abstract=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. | ||
|ISSN=0890-5401 | |||
|Link=https://www.sciencedirect.com/science/article/pii/S0890540121001462 | |||
|DOI Name=https://doi.org/10.1016/j.ic.2021.104816 | |DOI Name=https://doi.org/10.1016/j.ic.2021.104816 | ||
|Forschungsgruppe=Computational Logic | |Forschungsgruppe=Computational Logic | ||
}} | }} | ||
Version vom 11. April 2022, 13:24 Uhr
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
- 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}
}
