Pages that link to "Item:Q4919632"
From MaRDI portal
The following pages link to Recursive Unsolvability of a problem of Thue (Q4919632):
Displaying 30 items.
- Decidable approximations of term rewriting systems (Q5055873) (← links)
- On polynomial ideals, their complexity, and applications (Q5055880) (← links)
- The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups (Q5097713) (← links)
- The Bounded and Precise Word Problems for Presentations of Groups (Q5113919) (← links)
- The B B Newman spelling theorem (Q5163868) (← links)
- What’s Decidable About Program Verification Modulo Axioms? (Q5164172) (← links)
- Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability (Q5164857) (← links)
- Gröbner–Shirshov bases and their calculation (Q5172855) (← links)
- Combination techniques for non-disjoint equational theories (Q5210778) (← links)
- Subexponentials in non-commutative linear logic (Q5236554) (← links)
- Anisimov's Theorem for inverse semigroups (Q5246502) (← links)
- The Developments of the Concept of Machine Computability from 1936 to the 1960s (Q5250213) (← links)
- The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes (Q5277914) (← links)
- Regular canonical systems (Q5338328) (← links)
- ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA (Q5401559) (← links)
- DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) (← links)
- Thickness of Feathers (Q5495312) (← links)
- The equivalence of some general combinatorial decision problems (Q5556434) (← links)
- A Note on Pushdown Store Automata and Regular Systems (Q5573974) (← links)
- The many-one equivalence of some general combinatorial decision problems (Q5619078) (← links)
- Computability and Recursion (Q5689263) (← links)
- Rigidity is undecidable (Q5740405) (← links)
- The word problem for semigroups with two generators (Q5791233) (← links)
- Monoïdes préordonnés et chaînes de Malcev (Q5825705) (← links)
- On one-relator groups and units of special one-relation inverse monoids (Q5877774) (← links)
- Generic complexity of the word problem in some semigroups (Q6148012) (← links)
- An explicit algorithm for normal forms in small overlap monoids (Q6162859) (← links)
- Product decompositions of semigroups induced by action pairs (Q6190567) (← links)
- Early verification of legal compliance via bounded satisfiability checking (Q6535696) (← links)
- On undecidability of the propositional logic of an associative binary modality (Q6617171) (← links)
