Crisp-determinization of weighted tree automata over strong bimonoids

Abstract

We consider weighted tree automata (wta) over strong bimonoids and their initial algebra semantics and their run semantics. There are wta for which these semantics are different; however, for bottom-up deterministic wta and for wta over semirings, the difference vanishes. A wta is crisp-deterministic if it is bottom-up deterministic and each transition is weighted by one of the unit elements of the strong bimonoid. We prove that the class of weighted tree languages recognized by crisp-deterministic wta is the same as the class of recognizable step mappings. Moreover, we investigate the following two crisp-determinization problems: for a given wta $\mathcal{A}$, (a) does there exist a crisp-deterministic wta which computes the initial algebra semantics of $\mathcal{A}$ and (b) does there exist a crisp-deterministic wta which computes the run semantics of $\mathcal{A}$? We show that the finiteness of the Nerode algebra $\mathcal{N}(\mathcal{A})$ of $\mathcal{A}$ implies a positive answer for (a), and that the finite order property of $\mathcal{A}$ implies a positive answer for (b). We show a sufficient condition which guarantees the finiteness of $\mathcal{N}(\mathcal{A})$ and a sufficient condition which guarantees the finite order property of $\mathcal{A}$. Also, we provide an algorithm for the construction of the crisp-deterministic wta according to (a) if $\mathcal{N}(\mathcal{A})$ is finite, and similarly for (b) if $\mathcal{A}$ has finite order property. We prove that it is undecidable whether an arbitrary wta $\mathcal{A}$ is crisp-determinizable. We also prove that both, the finiteness of $\mathcal{N}(\mathcal{A})$ and the finite order property of $\mathcal{A}$ are undecidable.

Cited by in corpus (1)

• Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields