The Theory of Stabilisation Monoids and Regular Cost Functions
From MaRDI portal
Publication:3638091
DOI10.1007/978-3-642-02930-1_12zbMath1248.68291OpenAlexW1494274610MaRDI QIDQ3638091
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_12
Related Items (33)
The Theory of Universal Graphs for Infinite Duration Games ⋮ Approximate comparison of functions computed by distance automata ⋮ On Determinisation of Good-for-Games Automata ⋮ Unnamed Item ⋮ Asymptotic Monadic Second-Order Logic ⋮ Stamina: stabilisation monoids in automata theory ⋮ Width of Non-deterministic Automata ⋮ Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Contractibility for open global constraints ⋮ On history-deterministic one-counter nets ⋮ A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct ⋮ Minimization of automata for liveness languages ⋮ Foundations of graph path query languages. Course notes for the reasoning web summer school 2021 ⋮ Unnamed Item ⋮ History-deterministic timed automata are not determinizable ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ Semantic flowers for good-for-games and deterministic automata ⋮ Quantitative vs. weighted automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Limited Non-determinism Hierarchy of Counter Automata ⋮ Better complexity bounds for cost register automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Stone duality, topological algebra, and recognition. ⋮ Quantifying Bounds in Strategy Logic ⋮ Deciding Maxmin Reachability in Half-Blind Stochastic Games ⋮ Büchi Good-for-Games Automata Are Efficiently Recognizable ⋮ Minimizing GFG Transition-Based Automata ⋮ Guarded Ontology-Mediated Queries ⋮ Better complexity bounds for cost register automata
This page was built for publication: The Theory of Stabilisation Monoids and Regular Cost Functions
