ON THE WORD AND DIVISIBILITY PROBLEMS IN SEMIGROUPS WITH A SINGLE DEFINING RELATION

DOI10.1070/IM1978V012N02ABEH001848zbMATH Open0401.20050OpenAlexW2037791881MaRDI QIDQ4185044FDOQ4185044

Authors: Sergey I. Adian, G. U. Oganesyan 

Publication date: 1978

Published in: Mathematics of the USSR-Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im1978v012n02abeh001848

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05)

Cited In (7)

• Correction to: ``The word problem for one-relation monoids: a survey
• Unsolvable algorithmic problems for semigroups, groups and rings
• On termination of confluent one-rule string-rewriting systems
• Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System
• On the Dehn functions of a class of monadic one-relation monoids
• The word problem for one-relation monoids: a survey
• On the word problem for weakly compressible monoids

This page was built for publication: ON THE WORD AND DIVISIBILITY PROBLEMS IN SEMIGROUPS WITH A SINGLE DEFINING RELATION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4185044)