The Supports of Weighted Unranked Tree Automata
Manfred Droste, Doreen Heusel · Fundamenta Informaticae · 2015
We investigate the supports of weighted unranked tree automata. Our main result states that the support of a weighted unranked tree automaton over a zero-sum free, commutative strong bimonoid is recognizable. For this, we use methods of Kirsten (DLT