Determinization of integral discounted-sum automata is decidable

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

Authors: 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
• On delay and regret determinization of max-plus automata
• 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)