Some decidability and undecidability results on Green's relations for automatic monoids.
From MaRDI portal
Publication:2464344
DOI10.1007/s00233-007-0713-yzbMath1138.20048MaRDI QIDQ2464344
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
undecidability; decidability; Green relations; regular languages; automatic structures; finitely generated monoids; decision algorithms; automatic monoids
20M05: Free semigroups, generators and relations, word problems
20M35: Semigroups in automata theory, linguistics, etc.
Related Items