On the Expressive Power of Cost Logics over Infinite Words

DOI10.1007/978-3-642-31585-5_28zbMath1433.03102OpenAlexW14848105MaRDI QIDQ3167019

Michael Vanden Boom, Denis Kuperberg

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_28

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Higher-order logic (03B16)

Related Items (4)

Index Problems for Game Automata ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Positive First-order Logic on Words and Graphs ⋮ Quantifying Bounds in Strategy Logic

This page was built for publication: On the Expressive Power of Cost Logics over Infinite Words