Some results on Green's relations for monoids presented by monadic string-rewriting systems

DOI10.1007/S002330010139zbMath1016.20050OpenAlexW1978254514MaRDI QIDQ1849636

Friedrich Otto

Publication date: 1 December 2002

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

Full work available at URL: https://doi.org/10.1007/s002330010139

zbMATH Keywords

decidabilityGreen relationsregular setsfinite monadic confluent string-rewriting systemsirreducible strings

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Undecidability and degrees of sets of sentences (03D35) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42)

This page was built for publication: Some results on Green's relations for monoids presented by monadic string-rewriting systems