Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable (Q2040408)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable |
scientific article |
Statements
Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable (English)
0 references
14 July 2021
0 references
strong bimonoid
0 references
semiring
0 references
weighted tree automaton
0 references
determinization
0 references
decidability
0 references
