A Theorem on Supports of Weighted Tree Automata Over Strong Bimonoids

Maryam Ghorani and Heiko Vogler
Additional contact information
Maryam Ghorani: Faculty of Mathematical Sciences, Shahrood, University of Technology, Shahrood, Iran
Heiko Vogler: Faculty of Computer Science, Technische, Universität Dresden, Germany

New Mathematics and Natural Computation (NMNC), 2023, vol. 19, issue 02, 579-594

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.

Keywords: Weighted tree automata; strong bimonoid; recognizable tree language; partially ordered set; support (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S1793005723500230
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:nmncxx:v:19:y:2023:i:02:n:s1793005723500230

Ordering information: This journal article can be ordered from

DOI: 10.1142/S1793005723500230

Access Statistics for this article

New Mathematics and Natural Computation (NMNC) is currently edited by Paul P Wang

More articles in New Mathematics and Natural Computation (NMNC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().