Quantitative Monadic Second-Order Logic

DOI10.1109/LICS.2013.16zbMath1366.03216OpenAlexW2126766880WikidataQ130860796 ScholiaQ130860796MaRDI QIDQ5271046

Stephan Kreutzer, Cristian Riveros

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2013.16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (8)

Unnamed Item ⋮ Counting single-qubit Clifford equivalent graph states is #P-complete ⋮ Copyless cost-register automata: structure, expressiveness, and closure properties ⋮ On Finite and Polynomial Ambiguity of Weighted Tree Automata ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs ⋮ A logic-based approach to incremental reasoning on multi-agent systems ⋮ Unnamed Item ⋮ A robust class of linear recurrence sequences

This page was built for publication: Quantitative Monadic Second-Order Logic