The supports of weighted unranked tree automata

DOI10.3233/FI-2015-1143MaRDI QIDQ2805397zbMATH OpenFDO

Authors Doreen Heusel, Manfred Droste

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2015-1143

zbMATH Keywords

unranked treebimonoidnested weighted automatonsupport of a tree seriesweighted pushdown automatonweighted unranked tree automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 6124028
• Weighted finite automata over strong bimonoids
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
• A Nivat theorem for quantitative automata on unranked trees
• Weighted tree automata and tree transducers
• Weighted logics for unranked tree automata
• Weighted tree-walking automata
• Characterizations of recognizable weighted tree languages by logic and bimorphisms
• Weighted tree generating regular systems over strong bimonoids with reduction semantics
• Crisp-determinization of weighted tree automata over strong bimonoids

Cited in

(6)

• Weighted tree automata with constraints
• Compositions with Constant Weighted Extended Tree Transducers
• Weighted tree automata with constraints
• Solving the Weighted HOM-Problem With the Help of Unambiguity
• Weighted automata with storage
• Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings

This page was built for publication: The supports of weighted unranked tree automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805397)