scientific article; zbMATH DE number 1419255

MaRDI QIDQ4942274zbMATH OpenFDO

Authors Friedrich Otto

Publication date 9 October 2000

zbMATH Keywords

decidabilitydecision problemsfinite presentationsfinitely presented monoidsundecidabilityword problems

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)

Recommendations

• Uniform decision problems for certain restricted classes of finite monoid presentations -- a survey on recent undecidability results
• New undecidability results for finitely presented monoids
• scientific article; zbMATH DE number 1254106
• Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
• On deciding whether a monoid is a free monoid or is a group

Cited in

(5)

• Undecidable properties of monoids with word problem solvable in linear time.
• Some decidability and undecidability results on Green's relations for automatic monoids.
• Uniform decision problems for certain restricted classes of finite monoid presentations -- a survey on recent undecidability results
• scientific article; zbMATH DE number 1254106 (Why is no real title available?)
• Cross-sections for finitely presented monoids with decidable word problems

Describes a project that uses

Uses Software

• Cayley

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942274)