Word problem languages for free inverse monoids
From MaRDI portal
Publication:777984
DOI10.1007/978-3-319-94631-3_3zbMath1435.68149arXiv1803.08034OpenAlexW2962996020MaRDI QIDQ777984
Publication date: 30 June 2020
Full work available at URL: https://arxiv.org/abs/1803.08034
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Inverse semigroups (20M18)
Related Items (3)
On the word problem for free products of semigroups and monoids ⋮ The algebra of rewriting for presentations of inverse monoids ⋮ A language hierarchy of binary relations
This page was built for publication: Word problem languages for free inverse monoids