Pages that link to "Item:Q3638091"
From MaRDI portal
The following pages link to The Theory of Stabilisation Monoids and Regular Cost Functions (Q3638091):
Displaying 33 items.
- Approximate comparison of functions computed by distance automata (Q290904) (← links)
- Better complexity bounds for cost register automata (Q1999991) (← links)
- Stamina: stabilisation monoids in automata theory (Q2399252) (← links)
- Parameterized linear temporal logics meet costs: still not costlier than LTL (Q2413483) (← links)
- Quantitative vs. weighted automata (Q2695484) (← links)
- Deciding Maxmin Reachability in Half-Blind Stochastic Games (Q2819447) (← links)
- Asymptotic Monadic Second-Order Logic (Q2922005) (← links)
- Width of Non-deterministic Automata (Q3304146) (← links)
- On Determinisation of Good-for-Games Automata (Q3449484) (← links)
- Contractibility for open global constraints (Q4593091) (← links)
- Limited Non-determinism Hierarchy of Counter Automata (Q4910447) (← links)
- (Q5013884) (← links)
- Guarded Ontology-Mediated Queries (Q5015964) (← links)
- (Q5021013) (← links)
- (Q5028456) (← links)
- The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
- Quantifying Bounds in Strategy Logic (Q5079747) (← links)
- Büchi Good-for-Games Automata Are Efficiently Recognizable (Q5090951) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- (Q5091266) (← links)
- (Q5101349) (← links)
- Better complexity bounds for cost register automata (Q5111238) (← links)
- (Q5207047) (← links)
- (Q5875380) (← links)
- Stone duality, topological algebra, and recognition. (Q5964103) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)
- Token Games and History-Deterministic Quantitative-Automata (Q6178674) (← links)
- Semantic flowers for good-for-games and deterministic automata (Q6195342) (← links)
- A Myhill-Nerode theorem for higher-dimensional automata (Q6535191) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
- Checking history-determinism is NP-hard for parity automata (Q6629459) (← links)
- History-deterministic timed automata (Q6635511) (← links)
