Pages that link to "Item:Q2846575"
From MaRDI portal
The following pages link to Regular Cost Functions, Part I: Logic and Algebra over Words (Q2846575):
Displayed 18 items.
- Better complexity bounds for cost register automata (Q1999991) (← links)
- A topological shuttle between inequalities and pseudoinequalities (Q2031452) (← links)
- The factorisation forest theorem (Q2074219) (← links)
- Controlling a random population (Q2200817) (← links)
- Stamina: stabilisation monoids in automata theory (Q2399252) (← links)
- Deciding Maxmin Reachability in Half-Blind Stochastic Games (Q2819447) (← links)
- Asymptotic Monadic Second-Order Logic (Q2922005) (← links)
- Trading Bounds for Memory in Games with Counters (Q3449476) (← links)
- An Approach to Computing Downward Closures (Q3449495) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- (Q5028432) (← links)
- (Q5076057) (← links)
- Quantifying Bounds in Strategy Logic (Q5079747) (← links)
- Better complexity bounds for cost register automata (Q5111238) (← links)
- <i>ω♯</i>-Algebras (Q5159802) (← links)
- A characterization of lambda-terms transforming numerals (Q5371970) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
- Positive First-order Logic on Words and Graphs (Q6135776) (← links)