On Omega-Languages Defined by Mean-Payoff Conditions

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-00596-1_24
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Mean-Payoff Parity Games

English

Mean-Payoff Games and Propositional Proofs

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2011English

Perfect-Information Stochastic Mean-Payoff Parity Games

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes

2015English

Factorizations and Universal Automaton of Omega Languages

International Journal of Foundations of Computer Science
Computer Science
2014English

Topological Properties of Omega Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2001English

A Pseudo-Quasi-Polynomial Algorithm for Mean-Payoff Parity Games

2018English

Regularity of Languages Defined by Formal Series With Isolated Cut Point

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2012English

Memoryless Determinacy of Parity and Mean Payoff Games: A Simple Proof

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy