Two-way cost automata and cost logics over infinite trees

DOI10.1145/2603088.2603104MaRDI QIDQ4635599zbMATHOpenAlexWikidataFDO

Authors Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Paweł Parys, Michael Vanden Boom

Publication date 23 April 2018

Published in Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2603088.2603104

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Recommendations

• Weak cost monadic logic over infinite trees
• On the Expressive Power of Cost Logics over Infinite Words
• Logic and regular cost functions
• Quasi-weak cost automata: a new variant of weakness
• Regular cost functions. I: Logic and algebra over words

Cited in

(10)

• Faster algorithms for quantitative verification in bounded treewidth graphs
• Decidable models of integer-manipulating programs with recursive parallelism
• Cost Automata, Safe Schemes, and Downward Closures
• Weak cost monadic logic over infinite trees
• scientific article; zbMATH DE number 7561597 (Why is no real title available?)
• scientific article; zbMATH DE number 7526052 (Why is no real title available?)
• Definability and transformations for cost logics and automatic structures
• Trading bounds for memory in games with counters
• On the Expressive Power of Cost Logics over Infinite Words
• Logic and regular cost functions

This page was built for publication: Two-way cost automata and cost logics over infinite trees

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