A finitely presented monoid which has solvable word problem but has no regular complete presentation

DOI10.1016/0304-3975(94)00264-JzbMath0873.68105OpenAlexW1975351486MaRDI QIDQ673144

Yuji Kobayashi

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00264-j

zbMATH Keywords

rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

Numerical upper bounds on growth of automaton groups ⋮ Constructing finitely presented monoids which have no finite complete presentation ⋮ Gröbner bases of associative algebras and the Hochschild cohomology ⋮ The monoids of the patience sorting algorithm ⋮ Finitely presented monoids with linear Dehn function need not have regular cross-sections.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• Systems of reductions
• Word problems and a homological finiteness condition for monoids
• Über die Gelfand-Kirillov-Dimension. (On the Gelfand-Kirillov-dimension)
• Presentations of groups and monoids
• Infinite regular Thue systems
• Growth functions for some one-relator monoids
• The Knuth-Bendix Completion Procedure and Thue Systems

This page was built for publication: A finitely presented monoid which has solvable word problem but has no regular complete presentation