Two-way cost automata and cost logics over infinite trees
DOI10.1145/2603088.2603104zbMATH Open1401.68147OpenAlexW2158185919WikidataQ130898132 ScholiaQ130898132MaRDI QIDQ4635599FDOQ4635599
Achim Blumensath, Denis Kuperberg, Michael Vanden Boom, Paweł Parys, Thomas Colcombet
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
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)
Cited In (7)
- Trading Bounds for Memory in Games with Counters
- Cost Automata, Safe Schemes, and Downward Closures
- Decidable models of integer-manipulating programs with recursive parallelism
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Expressive Power of Cost Logics over Infinite Words
- Faster algorithms for quantitative verification in bounded treewidth graphs
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)
