Results 1 to 10 of about 494,097 (364)
Decidability Results for the Boundedness Problem [PDF]
Logical Methods in Computer Science, 2014 We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees.
Achim Blumensath +2 more
doaj +5 more sources
A new proof for the decidability of D0L ultimate periodicity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We give a new proof for the decidability of the D0L ultimate periodicity problem based on the decidability of p-periodicity of morphic words adapted to the approach of Harju and Linna.
Vesa Halava, Tero Harju, Tomi Kärki
doaj +4 more sources
Decision Problems for Deterministic Pushdown Automata on Infinite Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The article surveys some decidability results for DPDAs on infinite words (omega-DPDA). We summarize some recent results on the decidability of the regularity and the equivalence problem for the class of weak omega-DPDAs.
Christof Löding
doaj +4 more sources
A dependent nominal type theory [PDF]
Logical Methods in Computer Science, 2012 Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and
James Cheney
doaj +3 more sources
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond [PDF]
Logical Methods in Computer Science, 2022 The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that
Rupak Majumdar +2 more
doaj +1 more source
DECIDING ON WHAT TO DECIDE [PDF]
International Economic Review, 2021 AbstractWe study two‐stage collective decision‐making procedures where in the first stage, part of the voters decide what issues will be put in the agenda and in the second stage, the whole set of voters decides on the positions to be adopted regarding the issues that are in the agenda.
Barberà, Salvador, Gerber, Anke
openaire +5 more sources
Decidability Preservation and Complexity Bounds for Combined Logics
Mathematics, 2022 Transfer theorems for combined logics provide essential tools and insight for reasoning about complex logical systems. In this paper, we present the first sufficient criterion (contextual extensibility) for decidability to be preserved through ...
Carlos Caleiro, Sérgio Marcelino
doaj +1 more source
Resynchronized Uniformization and Definability Problems for Rational Relations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations.
Christof Löding, Sarah Winter
doaj +1 more source
Philosophies, 2023 The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that ...
Nathan Salmon
doaj +1 more source
Karp-Miller Trees for a Branching Extension of VASS [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We study BVASS (Branching VASS) which extend VASS (Vector Addition Systems with States) by allowing addition transitions that merge two configurations. Runs in BVASS are tree-like structures instead of linear ones as for VASS.
Kumar Neeraj Verma +1 more
doaj +2 more sources