Pages that link to "Item:Q5271046"
From MaRDI portal
The following pages link to Quantitative Monadic Second-Order Logic (Q5271046):
Displaying 17 items.
- Copyless cost-register automata: structure, expressiveness, and closure properties (Q1740663) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- A robust class of linear recurrence sequences (Q2105454) (← links)
- Computability by monadic second-order logic (Q2656341) (← links)
- On second-order monadic monoidal and groupoidal quantifiers (Q2786142) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- Asymptotic Monadic Second-Order Logic (Q2922005) (← links)
- Pumping lemmas for weighted automata (Q3304149) (← links)
- Computational Semantics for Monadic Quantifiers (Q4236059) (← links)
- Monadic Second Order Logic with Measure and Category Quantifiers (Q4637695) (← links)
- (Q4993769) (← links)
- Counting single-qubit Clifford equivalent graph states is #P-complete (Q5110740) (← links)
- Monitor Logics for Quantitative Monitor Automata (Q5111228) (← links)
- (Q5155668) (← links)
- On polynomial recursive sequences (Q6614607) (← links)
- Finite sequentiality of finitely ambiguous max-plus tree automata (Q6614608) (← links)