Reasoning about online algorithms with weighted automata
From MaRDI portal
Publication:2930304
DOI10.1145/1721837.1721844zbMath1300.68071OpenAlexW2070937106MaRDI QIDQ2930304
Benjamin Aminof, Robby Lampert, Orna Kupferman
Publication date: 18 November 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1721837.1721844
Analysis of algorithms (68W40) Formal languages and automata (68Q45) Online algorithms; streaming algorithms (68W27)
Related Items
Rigorous approximated determinization of weighted automata ⋮ Stochastization of Weighted Automata ⋮ Coping with selfish on-going behaviors ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ Quantitative vs. weighted automata ⋮ Non-deterministic Weighted Automata on Random Words ⋮ Reactive synthesis without regret ⋮ Non-deterministic weighted automata evaluated over Markov chains ⋮ Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines ⋮ Unnamed Item ⋮ What's decidable about weighted automata?
