Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
type: Item
instance of: scholarly article
title: Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
zbMATH Open document ID: 1496.68207
DOI: 10.1007/978-3-030-62536-8_4
author: Zoltán Fülöp
author: Dávid Kószó
author: Heiko Vogler
author: Manfred Droste
publication date: 2021-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 7371288
zbMATH Keywords: strong bimonoid
zbMATH Keywords: semiring
zbMATH Keywords: weighted tree automaton
zbMATH Keywords: determinization
zbMATH Keywords: decidability
MaRDI profile type: Publication
full work available at URL: 978-3-030-62536-8 4
OpenAlex ID: W3101648021
description: scientific article; zbMATH DE number 7371288