scientific article; zbMATH DE number 3301426
From MaRDI portal
Publication:5583066
zbMath0189.01102MaRDI QIDQ5583066
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
A Lyndon's identity theorem for one-relator monoids ⋮ On ground AC-completion ⋮ On some algorithmic problems for groups and monoids ⋮ On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups ⋮ An undecidable problem for countable markov chains ⋮ Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup ⋮ Deciding the word problem in the union of equational theories. ⋮ Levels of undecidability in rewriting ⋮ Sur la liaison entre problèmes combinatoires et algorithmiques ⋮ Algorithmically finite groups. ⋮ A note on Post's correspondence problem ⋮ The word problem for one-relation monoids: a survey ⋮ Some undecidable termination problems for semi-Thue systems ⋮ Word problem for deterministic and reversible semi-Thue systems ⋮ Decision problems for semi-Thue systems with a few rules ⋮ Non-resolution theorem proving ⋮ Universal group with twenty-one defining relations ⋮ A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method ⋮ Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian ⋮ Frontier between decidability and undecidability: 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
This page was built for publication:
