Abstract
We investigate weighted tree automata over strong bimonoids. Intuitively, strong bimonoids are semirings which may lack the distributivity laws. For instance, each (not necessarily distributive) bounded lattice is a strong bimonoid. In general, for a weighted tree automaton over a strong bimonoid, its run semantics is different from its initial algebra semantics. We prove that for positive strong bimonoids the supports of these semantics are equal, and we also deal with a kind of reverse statement.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
