FINITE IDEMPOTENT INVERSE MONOID PRESENTATIONS

DOI10.1142/S0218196711006868zbMath1246.20049OpenAlexW2152410090MaRDI QIDQ3112581

Pedro V. Silva

Publication date: 11 January 2012

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196711006868

zbMATH Keywords

maximal subgroupsdecision problemsword probleminverse monoidsfinite idempotent presentationsidempotent-pure congruences

Mathematics Subject Classification ID

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

Related Items (1)

Amalgams of finite inverse semigroups and deterministic context-free languages.

Cites Work

• Presentations of inverse monoids
• Inverse monoids and rational Schreier subsets of the free group
• Inverse monoids: decidability and complexity of algebraic questions.
• ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS
• FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
• RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS
• CONJUGACY AND TRANSPOSITION FOR INVERSE MONOID PRESENTATIONS
• Free group languages: Rational versus recognizable
• Trees associated to inverse monoid presentations

This page was built for publication: FINITE IDEMPOTENT INVERSE MONOID PRESENTATIONS