The Complexity of Mean-Payoff Automaton Expression
From MaRDI portal
Publication:3167028
DOI10.1007/978-3-642-31585-5_36zbMath1367.68178MaRDI QIDQ3167028
Publication date: 1 November 2012
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_36
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Decidable weighted expressions with Presburger combinators, Faster algorithms for quantitative verification in bounded treewidth graphs, Hyperplane separation technique for multidimensional mean-payoff games, Temporal Specifications with Accumulative Values