Abstract (EN):
We prove that the equality problem is decidable for rational subsets of the monogenic free inverse monoid F. It is also decidable whether or not a rational subset of F is recognizable. We prove that a submonoid of F is rational if and only if it is finitely generated. We also prove that the membership problem for rational subsets of a finite J-above monoid is decidable, covering the case of free inverse monoids.(c) 2022 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Idioma:
Inglês
Tipo (Avaliação Docente):
Científica
Nº de páginas:
27