Decision problems for inverse monoids presented by a single sparse relator.

DOI10.1007/S00233-010-9247-9zbMath1208.20049arXiv0911.1484OpenAlexW1993637468MaRDI QIDQ5962338

Steven Lindblad, Susan M. Hermiller, John C. Meakin

Publication date: 22 September 2010

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

Full work available at URL: https://arxiv.org/abs/0911.1484

zbMATH Keywords

word probleminverse monoidsregular languagesSchützenberger graphscontext free languagesgenerators and relations

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Inverse semigroups (20M18)

Related Items (7)

A tribute to John Meakin on the occasion of his 75th birthday ⋮ The word problem for one-relation monoids: a survey ⋮ Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups ⋮ New results on the prefix membership problem for one-relator groups ⋮ Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs ⋮ Solution of the membership problem of the prefix monoid in certain one-relator groups. ⋮ On one-relator groups and units of special one-relation inverse monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Presentations of inverse monoids
• Inverse monoids and rational subsets of related groups
• The word problem of inverse monoids presented by one idempotent relator
• A topological approach to inverse and regular semigroups.
• Free Inverse Semigroups
• On one-relator monoids and one-relator groups

This page was built for publication: Decision problems for inverse monoids presented by a single sparse relator.