Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable
Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-review
Contributors
Details
Original language | English |
---|---|
Title of host publication | Descriptional Complexity of Formal Systems |
Editors | Galina Jirásková, Giovanni Pighizzini |
Pages | 39-51 |
Number of pages | 13 |
Publication status | Published - 2020 |
Peer-reviewed | Yes |
Publication series
Series | Lecture Notes in Computer Science, Volume 12442 |
---|---|
ISSN | 0302-9743 |
External IDs
Scopus | 85097381632 |
---|
Keywords
Keywords
- Strong bimonoid, Determinization, Decidability, Semiring, Weighted tree automaton