Pages that link to "Item:Q5845383"

The following pages link to A variant of a recursively unsolvable problem (Q5845383):

Displaying 50 items.

• Equalizers and kernels in categories of monoids (Q1702518) (← links)
• On the decidability of subtyping with bounded existential types and implementation constraints (Q1758661) (← links)
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
• Ambiguity and decision problems for local adjunct languages (Q1843306) (← links)
• Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
• Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
• Recognizability of the support of recognizable series over the semiring of the integers is undecidable (Q1944933) (← links)
• Pseudo-inversion: closure properties and decidability (Q2003444) (← links)
• Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
• On transitive modal many-valued logics (Q2035340) (← links)
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
• Context-sensitive fusion grammars and fusion grammars with forbidden context are universal (Q2084774) (← links)
• Hilbert's tenth problem for term algebras with a substitution operator (Q2104269) (← links)
• Unambiguous injective morphisms in free groups (Q2105430) (← links)
• String assembling systems: comparison to sticker systems and decidability (Q2152089) (← links)
• First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
• The decidability of verification under PS 2.0 (Q2233444) (← links)
• On first-order logic and CPDA graphs (Q2254514) (← links)
• On Post correspondence problem for letter monotonic languages (Q2271434) (← links)
• Synthesis from hyperproperties (Q2303878) (← links)
• Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
• On the decidability status of fuzzy \(\mathcal {A}\mathcal {L}\mathcal {C}\) with general concept inclusions (Q2341257) (← links)
• Gröbner-Shirshov bases for some Lie algebras (Q2360276) (← links)
• Undecidable iterative propositional calculus (Q2364331) (← links)
• Satisfiability of the smallest binary program (Q2366070) (← links)
• Extension of the decidability of the marked PCP to instances with unique blocks (Q2373757) (← links)
• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems (Q2383594) (← links)
• A note on controllability of deterministic context-free~systems (Q2391510) (← links)
• Pseudoknot-generating operation (Q2405891) (← links)
• Weighted picture automata and weighted logics (Q2429722) (← links)
• The limits of decidability in fuzzy description logics with general concept inclusions (Q2512986) (← links)
• Some definitional suggestions for automata theory (Q2529464) (← links)
• Über einen Automaten mit Pufferspeicherung (Q2537131) (← links)
• Parallel program schemata (Q2540014) (← links)
• On program schemata equivalence (Q2559261) (← links)
• The equivalence problem for deterministic TOL-systems is undecidable (Q2562694) (← links)
• Improved matrix pair undecidability results (Q2641877) (← links)
• Multiparty half-duplex systems and synchronous communications (Q2683034) (← links)
• An optimal quantum error-correcting procedure using quantifier elimination (Q2690239) (← links)
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) (Q2693019) (← links)
• GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMS (Q2709980) (← links)
• Undecidable Properties on Length-Two String Rewriting Systems (Q2873677) (← links)
• On the decidability of semigroup freeness (Q2905326) (← links)
• Undecidability of infinite post correspondence problem for instances of size 8 (Q2905329) (← links)
• A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy (Q2946765) (← links)
• Asymptotic Density and the Theory of Computability: A Partial Survey (Q2970976) (← links)
• GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS (Q3016223) (← links)
• UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES (Q3065609) (← links)
• ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (Q3069735) (← links)
• REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM (Q3086251) (← links)