Amanote Research

Amanote Research

    RegisterSign In

Decidability and Undecidability of Marked PCP

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-49116-3_19
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1999

Authors
Vesa HalavaMika HirvensaloRonald de Wolf
Publisher

Springer Berlin Heidelberg


Related search

Monadic Fragments of Gödel Logics: Decidability and Undecidability Results

English

SAT in Monadic Gödel Logics: A Borderline Between Decidability and Undecidability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Decidability and Syntactic Control of Interference

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2008English

What Is Absolute Undecidability?†

Nous
Philosophy
2012English

Undecidability in the Act . . .

The Undecidable Unconscious: A Journal of Deconstruction and Psychoanalysis
2014English

The n-r.e. DEGREES: UNDECIDABILITY AND Σ1SUBSTRUCTURES

Journal of Mathematical Logic
Logic
2012English

On the Decidability of FDNC Programs

Intelligenza Artificiale
Artificial Intelligence
2011English

Decidability of Context-Explicit Security Protocols

Journal of Computer Security
RiskComputer NetworksHardwareCommunicationsReliabilitySafetyArchitectureQualitySoftware
2005English

Type Structure Complexity and Decidability

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1982English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy