The supports of weighted unranked tree automata

DOI10.3233/FI-2015-1143zbMATH Open1341.68088MaRDI QIDQ2805397FDOQ2805397

Doreen Heusel, Manfred Droste

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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)

Cited In (5)

• 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

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎
• Characterizations of recognizable weighted tree languages by logic and bimorphisms 👍 👎
• Title not available (Why is that?) 👍 👎
• Crisp-determinization of weighted tree automata over strong bimonoids 👍 👎

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)