Exact and Approximate Determinization of Discounted-Sum Automata
A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, valuing a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by $\lambda^i$, where the discount factor $\lambda$ is a fixed rational number...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Logical Methods in Computer Science e.V.
2014-02-01
|
| Sarja: | Logical Methods in Computer Science |
| Aiheet: | |
| Linkit: | https://lmcs.episciences.org/1104/pdf |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|