On Determinizability of Tropical Weighted Automata
ACM SIGLOG News · 01.07.2026 · 13 (3) · 4-21
DOI: 10.1145/3832064.3832068 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM SIGLOG News, online erschienen am 19.08.2026. Verfasst von Shaull Almagor. Die Arbeit nennt 34 Literaturangaben.
Abstract (Originalsprache)
We survey the history of the determinizability problem for min-plus (tropical) weighted automata. Traditional automata accept or reject their input, and are therefore Boolean, in the sense that their language is a function L : Σ * → {0, 1}. They are well-understood, and have provided the theoretical basis for many applications, most notably in formal verification. However, today's rich systems and properties are often unsuitable to model with Boolean models, mostly due to the presence of quantitative elements, such as energy, probability, counters, etc.
Zitieren
APA
Almagor, S. (2026). On Determinizability of Tropical Weighted Automata. ACM SIGLOG News, 13(3), 4-21. https://doi.org/10.1145/3832064.3832068
Vancouver
Almagor S. On Determinizability of Tropical Weighted Automata. ACM SIGLOG News. 2026;13(3):4-21. doi:10.1145/3832064.3832068
BibTeX
@article{Almagor2026,
author = {Almagor, Shaull},
title = {On Determinizability of Tropical Weighted Automata},
journal = {ACM SIGLOG News},
year = {2026},
volume = {13},
number = {3},
pages = {4--21},
doi = {10.1145/3832064.3832068}
}
EUVIMED