Presentations of groups and monoids
From MaRDI portal
Publication:1256061
DOI10.1016/0021-8693(79)90238-2zbMath0403.20022OpenAlexW2070333917MaRDI QIDQ1256061
Publication date: 1979
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-8693(79)90238-2
Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm, SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID, Commutative monoids have complete presentations by free (non-commutative) monoids, A catalogue of complete group presentations, Stallings graphs for quasi-convex subgroups, Infinite complete group presentations, The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems, Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems, An explicit algorithm for normal forms in small overlap monoids, About the descriptive power of certain classes of finite string-rewriting systems, Decision problems for finite special string-rewriting systems that are confluent on some congruence class, Word problems over traces which are solvable in linear time, 4-ENGEL GROUPS ARE LOCALLY NILPOTENT, When is an extension of a specification consistent? Decidable and undecidable cases, A finitely presented monoid which has solvable word problem but has no regular complete presentation, The use of Knuth-Bendix methods to solve the word problem in automatic groups, The Knuth-Bendix procedure for strings as a substitute for coset enumeration, Algebra and automated deduction, On weakly confluent monadic string-rewriting systems, GROWTH OF REES QUOTIENTS OF FREE INVERSE SEMIGROUPS DEFINED BY SMALL NUMBERS OF RELATORS, Verifying nilpotence, Automatic Groups Associated with Word Orders Other than Shortlex, On the Knuth-Bendix completion for concurrent processes, On deciding confluence of finite string-rewriting systems modulo partial commutativity, Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings, Enumeration of double cosets, On finite presentations of inverse semigroups with zero having polynomial growth, Search problems in groups and branching processes
Cites Work
