Solution of the membership problem of the prefix monoid in certain one-relator groups.

DOI10.1007/s00233-014-9614-zzbMath1332.20054OpenAlexW2045716962MaRDI QIDQ2340368

Arye Juhász

Publication date: 16 April 2015

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-014-9614-z

zbMATH Keywords

word probleminverse monoidscyclically reduced wordsmembership problemone-relator groupssmall cancellation conditionsprefix monoids

Mathematics Subject Classification ID

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) Inverse semigroups (20M18) Cancellation theory of groups; application of van Kampen diagrams (20F06)

Related Items (2)

Prefix monoids of groups and right units of special inverse monoids ⋮ New results on the prefix membership problem for one-relator groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A geometric characterization of automatic semigroups
• Small cancellation conditions satisfied by one-relator groups
• Small Cancellation Theory with a Unified Small Cancellation Condition I
• A Geometric Characterization of Automatic Monoids
• On one-relator monoids and one-relator groups
• Decision problems for inverse monoids presented by a single sparse relator.

This page was built for publication: Solution of the membership problem of the prefix monoid in certain one-relator groups.