scientific article
From MaRDI portal
Publication:3259710
zbMath0087.25303MaRDI QIDQ3259710
Publication date: 1958
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups ⋮ On the word problem for special monoids ⋮ Reconfiguration in bounded bandwidth and tree-depth ⋮ Generic complexity of the word problem in some semigroups ⋮ Algorithmically finite groups. ⋮ The word problem for \(1\mathcal{LC}\) congruences is NP-hard. ⋮ Symbol different term rewrite systems ⋮ 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 ⋮ Post correspondence problem for short words ⋮ Marked PCP is decidable ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS ⋮ Non-finitely generated maximal subgroups of context-free monoids
This page was built for publication:
