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

  • Manfred Droste - , Leipzig University (Author)
  • Zoltán Fülöp - , University of Szeged (Author)
  • Dávid Kószó - , University of Szeged (Author)
  • Heiko Vogler - , Chair of Foundations of Programming (Author)

Details

Original languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems
EditorsGalina Jirásková, Giovanni Pighizzini
Pages39-51
Number of pages13
Publication statusPublished - 2020
Peer-reviewedYes

Publication series

SeriesLecture Notes in Computer Science, Volume 12442
ISSN0302-9743

External IDs

Scopus 85097381632

Keywords

Keywords

  • Strong bimonoid, Determinization, Decidability, Semiring, Weighted tree automaton

Library keywords