Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable

From MaRDI portal

(Redirected from Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Crisp-determinization_of_weighted_tree_automata_over_additively_locally_finite_and_past-finite_monotonic_strong_bimonoids_is_decidable&oldid=71238432"