Linear weighted tree automata with storage and inverse linear tree homomorphisms
Research output: Contribution to journal › Research article › Contributed › peer-review
Contributors
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.
Details
| Original language | English |
|---|---|
| Article number | 104816 |
| Journal | Information and Computation |
| Volume | 281 |
| Publication status | Published - Dec 2021 |
| Peer-reviewed | Yes |
External IDs
| Scopus | 85119308105 |
|---|
Keywords
ASJC Scopus subject areas
Keywords
- Inverse linear tree homomorphisms, Linear pushdown tree automata, Linear weighted tree automata with storage