Linear weighted tree automata with storage and inverse linear tree homomorphisms

DOI10.1016/j.ic.2021.104816OpenAlexW3214436415MaRDI QIDQ2051842

Luisa Herrmann

Publication date: 25 November 2021

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104816

zbMATH Keywords

inverse linear tree homomorphismslinear pushdown tree automatalinear weighted tree automata with storage

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Büchi-like theorem for weighted tree automata over multioperator monoids
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Pushdown machines for the macro tree transducer
• Un théorème de Chomsky-Schützenberger pour les forets algébriques
• Spinal-formed context-free tree grammars
• Rational weighted tree languages with storage and the Kleene-Goldstine theorem
• Weighted automata with storage
• Linear context-free tree languages and inverse homomorphisms
• Some definitional suggestions for automata theory
• Tree acceptors and some of their applications
• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
• Pushdown tree automata
• The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars
• Une propri\'et\'e des forêts alg\'ebriques « de greibach \ra
• Forêts Algébriques et Homomorphismes Inverses
• Semirings and Formal Power Series
• An Approach to a Unified Theory of Automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• An Infinite Hierarchy of Context-Free Languages
• On context-free languages and push-down automata

This page was built for publication: Linear weighted tree automata with storage and inverse linear tree homomorphisms