Presentations of groups and monoids

DOI10.1016/0021-8693(79)90238-2MaRDI QIDQ1256061zbMATH OpenOpenAlexFDO

Authors Robert H. Gilman

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

zbMATH Keywords

Order of a Group with Given Finite PresentationPresentation of Finitely Generated Abelian Monoids

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05)

Cites work

• scientific article; zbMATH DE number 194089 (Why is no real title available?)
• scientific article; zbMATH DE number 3216273 (Why is no real title available?)
• scientific article; zbMATH DE number 3284302 (Why is no real title available?)
• On the geometry of semigroup presentations
• Shorter Notes: Redei's Finiteness Theorem for Commutative Semigroups
• Some algorithmic problems for finitely defined commutative semigroups

Cited in

(29)

• On weakly confluent monadic string-rewriting systems
• On deciding confluence of finite string-rewriting systems modulo partial commutativity
• PATCH graphs: an efficient data structure for completion of finitely presented groups
• Decision problems for finite special string-rewriting systems that are confluent on some congruence class
• Infinite complete group presentations
• Stallings graphs for quasi-convex subgroups
• When is an extension of a specification consistent? Decidable and undecidable cases
• A catalogue of complete group presentations
• Verifying nilpotence
• Growth of Rees quotients of free inverse semigroups defined by small numbers of relators.
• Algebra and automated deduction
• Automatic Groups Associated with Word Orders Other than Shortlex
• On finite presentations of inverse semigroups with zero having polynomial growth
• Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
• SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID
• About the descriptive power of certain classes of finite string-rewriting systems
• Word problems over traces which are solvable in linear time
• Commutative monoids have complete presentations by free (non-commutative) monoids
• Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems
• Search problems in groups and branching processes.
• The Knuth-Bendix procedure for strings as a substitute for coset enumeration
• The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems
• On the Knuth-Bendix completion for concurrent processes
• 4-ENGEL GROUPS ARE LOCALLY NILPOTENT
• The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm
• The use of Knuth-Bendix methods to solve the word problem in automatic groups
• Enumeration of double cosets
• An explicit algorithm for normal forms in small overlap monoids
• A finitely presented monoid which has solvable word problem but has no regular complete presentation

This page was built for publication: Presentations of groups and monoids

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