Determinization of integral discounted-sum automata is decidable

DOI10.1007/978-3-031-57228-9_10MaRDI QIDQ6629458FDOQ6629458

Shaull Almagor, Neta Dafni

Publication date: 30 October 2024

zbMATH Keywords

determinizationquantitative automatadiscounted sum automata

Mathematics Subject Classification ID

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

Cites Work

• The complexity of mean payoff games on graphs
• A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
• Multi-objective Discounted Reward Verification in Graphs and MDPs
• Alternating Weighted Automata
• Quantitative Languages
• Title not available (Why is that?)
• Exact and Approximate Determinization of Discounted-Sum Automata
• Skew and infinitary formal power series
• Title not available (Why is that?)
• The Target Discounted-Sum Problem
• The impatient may use limited optimism to minimize regret
• Determinizing discounted-sum automata
• Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
• On the comparison of discounted-sum automata with multiple discount factors
• Determinization of one-counter nets

This page was built for publication: Determinization of integral discounted-sum automata is decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629458)