Some decidability and undecidability results on Green's relations for automatic monoids.

DOI10.1007/s00233-007-0713-yzbMath1138.20048OpenAlexW1995360632MaRDI QIDQ2464344

Friedrich Otto

Publication date: 19 December 2007

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-007-0713-y

zbMATH Keywords

undecidabilitydecidabilityGreen relationsregular languagesautomatic structuresfinitely generated monoidsdecision algorithmsautomatic monoids

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

A strong geometric hyperbolicity property for directed graphs and monoids.

This page was built for publication: Some decidability and undecidability results on Green's relations for automatic monoids.