External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable

Manfred Droste, Zoltán Fülöp 0001, Dávid Kószó, Heiko Vogler. Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. In Galina Jirásková, Giovanni Pighizzini, editors, Descriptional Complexity of Formal Systems - 22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020, Proceedings. Volume 12442 of Lecture Notes in Computer Science, pages 39-51, Springer, 2020. [doi]

Authors

Manfred Droste

This author has not been identified. Look up 'Manfred Droste' in Google

Zoltán Fülöp 0001

This author has not been identified. Look up 'Zoltán Fülöp 0001' in Google

Dávid Kószó

This author has not been identified. Look up 'Dávid Kószó' in Google

Heiko Vogler

This author has not been identified. It may be one of the following persons: Look up 'Heiko Vogler' in Google
runs on