Weak Cost Monadic Logic over Infinite Trees

DOI10.1007/978-3-642-22993-0_52zbMath1343.03033OpenAlexW1525546443MaRDI QIDQ3088073

Michael Vanden Boom

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_52

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05)

Related Items (5)

Trading Bounds for Memory in Games with Counters ⋮ Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Weak Cost Monadic Logic over Infinite Trees