RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS

DOI10.1142/S0218196792000128zbMath0777.20023MaRDI QIDQ4039448

Pedro V. Silva

Publication date: 1 June 1993

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

zbMATH Keywords

idempotentsrational languagesfinite inverse monoididempotent- pure presentationsinverse monoid presentationunsolvable idempotent word problem

Mathematics Subject Classification ID

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

Related Items (11)

EMBEDDING THEOREMS FOR GROUPS PRESENTED VIA PARTIAL AUTOMORPHISMS: A GENERALIZATION OF SEMIDIRECT PRODUCTS AND HNN EXTENSIONS ⋮ The word problem for nilpotent inverse monoids ⋮ Inverse monoids: decidability and complexity of algebraic questions. ⋮ ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS ⋮ On one-relator monoids and one-relator groups ⋮ Amalgamated free products of inverse semigroups ⋮ Trees associated to inverse monoid presentations ⋮ FINITE IDEMPOTENT INVERSE MONOID PRESENTATIONS ⋮ On free inverse monoid languages ⋮ HNN EXTENSIONS OF SEMILATTICES ⋮ On one-relator groups and units of special one-relation inverse monoids

This page was built for publication: RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS