scientific article; zbMATH DE number 3301426
From MaRDI portal
Publication:5583066
Cited in
(22)- Sur la liaison entre problèmes combinatoires et algorithmiques
- A note on Post's correspondence problem
- Non-resolution theorem proving
- Universal group with twenty-one defining relations
- Deciding the word problem in the union of equational theories.
- Frontier between decidability and undecidability: A survey
- Decision problems for semi-Thue systems with a few rules
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
- The word problem for one-relation monoids: a survey
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols
- Correction to: ``The word problem for one-relation monoids: a survey
- A Lyndon's identity theorem for one-relator monoids
- Word problem for deterministic and reversible semi-Thue systems
- An undecidable problem for countable markov chains
- On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
- Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian
- On ground AC-completion
- On some algorithmic problems for groups and monoids
- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method
- Levels of undecidability in rewriting
- Algorithmically finite groups.
- Some undecidable termination problems for semi-Thue systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5583066)
