Abstract (EN):
We prove that the class of finitely presented inverse monoids whose Schutzenberger graphs are quasi-isometric to trees has a uniformly solvable word problem, furthermore, the languages of their Schutzenberger automata are context-free. On the other hand, we show that there is a finitely presented inverse monoid with hyperbolic Schutzenberger graphs and an unsolvable word problem.
Idioma:
Inglês
Tipo (Avaliação Docente):
Científica
Nº de páginas:
37