Cross-sections for finitely presented monoids with decidable word problems

DOI10.1007/3-540-62950-5_61MaRDI QIDQ4594218zbMATH OpenOpenAlexFDO

Authors Friedrich Otto, Masashi Katsura, Yuji Kobayashi

Publication date 17 November 2017

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-62950-5_61

Mathematics Subject Classification ID

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

Recommendations

• 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
• scientific article; zbMATH DE number 1419255
• Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions.
• scientific article; zbMATH DE number 4014693

Cited in

(7)

• Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
• Growing context-sensitive languages and Church-Rosser languages
• Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions.
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Finitely presented monoids with linear Dehn function need not have regular cross-sections.
• Equational Theorem Proving for Clauses over Strings
• Equational theorem proving for clauses over strings

This page was built for publication: Cross-sections for finitely presented monoids with decidable word problems

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