Decidability Results for the Boundedness Problem

DOI10.2168/LMCS-10(3:2)2014zbMath1337.03019arXiv1406.7684OpenAlexW2140885135MaRDI QIDQ2878748

Mark Weyer, Achim Blumensath, Martin Otto

Publication date: 5 September 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.7684

zbMATH Keywords

fixed pointsboundednessmonadic second-order logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (5)

Trading Bounds for Memory in Games with Counters ⋮ Unnamed Item ⋮ A More General Theory of Static Approximations for Conjunctive Queries ⋮ Unnamed Item ⋮ A more general theory of static approximations for conjunctive queries

This page was built for publication: Decidability Results for the Boundedness Problem