Determinization of Integral Discounted-Sum Automata is Decidable

Nondeterministic Discounted-Sum Automata (NDAs) are nondeterministic finite automata equipped with a discounting factor $\lambda>1$, and whose transitions are labelled by weights. The value of a run of an NDA is the discounted sum of the edge weights, where the $i$-th weight is divided by $\lambd...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Almagor, Shaull, Dafni, Neta
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Formal Languages and Automata Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!