Two-way cost automata and cost logics over infinite trees
From MaRDI portal
Publication:4635599
Recommendations
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)