Run supports and initial algebra supports of weighted automata
<|reference_start|>Run supports and initial algebra supports of weighted automata: We consider weighted automata over words and over trees where the weight algebras are strong bimonoids, i.e., semirings which may lack distributivity. It is well known that, for each such weighted automaton, its run semantics and its initial algebra semantics can be different, due to the presence of nondeterminism and the absence of distributivity. Here we investigate the question under which conditions on the strong bimonoid the support of the run semantics equals the support of the initial algebra semantics. We prove a characterization of this equality in terms of strongly zero-sum-free strong bimonoids (for weighted automata over words) and in terms of bi-strongly zero-sum-free strong bimonoids (for weighted automata over trees). We also consider shortly the images of the two semantics functions.<|reference_end|>
@article{droste2024run,
    title={Run supports and initial algebra supports of weighted automata},
    author={Manfred Droste, Heiko Vogler},
    journal={arXiv preprint arXiv:2409.08727},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.08727},
    primaryClass={cs.FL}
}