The following pages link to (Q5583066):
Displaying 22 items.
- Levels of undecidability in rewriting (Q627134) (← links)
- Algorithmically finite groups. (Q640937) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- Sur la liaison entre problèmes combinatoires et algorithmiques (Q1156785) (← links)
- A note on Post's correspondence problem (Q1164045) (← links)
- Non-resolution theorem proving (Q1238434) (← links)
- Universal group with twenty-one defining relations (Q1241591) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup (Q1921846) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← links)
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols (Q2090128) (← links)
- Correction to: ``The word problem for one-relation monoids: a survey'' (Q2099148) (← links)
- A Lyndon's identity theorem for one-relator monoids (Q2135760) (← links)
- Word problem for deterministic and reversible semi-Thue systems (Q2247995) (← links)
- An undecidable problem for countable markov chains (Q4007371) (← links)
- On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups (Q4558123) (← links)
- Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian (Q4992044) (← links)
- On ground AC-completion (Q5055778) (← links)
- On some algorithmic problems for groups and monoids (Q5055802) (← links)
- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method (Q5234683) (← links)
