Weak cost monadic logic over infinite trees

DOI10.1007/978-3-642-22993-0_52MaRDI QIDQ3088073zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Two-way cost automata and cost logics over infinite trees
• On the Expressive Power of Cost Logics over Infinite Words
• Deciding the weak definability of Büchi definable tree languages
• Quasi-weak cost automata: a new variant of weakness
• Regular cost functions. I: Logic and algebra over words

Cited in

(8)

• Two-way cost automata and cost logics over infinite trees
• Cost Automata, Safe Schemes, and Downward Closures
• scientific article; zbMATH DE number 7561597 (Why is no real title available?)
• On the Expressive Power of Cost Logics over Infinite Words
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Trading bounds for memory in games with counters
• Magnitude monadic logic over words and the use of relative internal set theory
• Parameterized linear temporal logics meet costs: still not costlier than LTL

This page was built for publication: Weak cost monadic logic over infinite trees

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