On the comparison of discounted-sum automata with multiple discount factors

DOI10.1007/978-3-031-30829-1_18arXiv2301.04086OpenAlexW4366503880MaRDI QIDQ6091205

Udi Boker, Guy Hefetz

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.04086

zbMATH Keywords

comparisoncontainmentdiscounted-sum automata

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reactive synthesis without regret
• A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata
• Skew and infinitary formal power series
• Beta-expansions for infinite families of Pisot and Salem numbers
• The complexity of mean payoff games on graphs
• Comparator automata in quantitative verification
• What's decidable about weighted automata?
• Quantitative assume guarantee synthesis
• Expressiveness and Closure Properties for Quantitative Languages
• Non-Zero Sum Games for Reactive Synthesis
• Multi-objective Discounted Reward Verification in Graphs and MDPs
• Quantitative languages
• Finite-Valued Weighted Automata.
• Alternating Weighted Automata
• Probabilistic Weighted Automata
• Energy and Mean-Payoff Games with Imperfect Information
• The Target Discounted-Sum Problem
• An automata-theoretic approach to branching-time model checking
• Exact and Approximate Determinization of Discounted-Sum Automata
• An unsolved problem on the powers of 3/2
• Quantitative Languages Defined by Functional Automata
• Unique representations of real numbers in non-integer bases

This page was built for publication: On the comparison of discounted-sum automata with multiple discount factors