Two-way cost automata and cost logics over infinite trees
From MaRDI portal
Publication:4635599
DOI10.1145/2603088.2603104zbMath1401.68147OpenAlexW2158185919MaRDI QIDQ4635599
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) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25)
Related Items
Trading Bounds for Memory in Games with Counters ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Unnamed Item ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ Unnamed Item ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs
