A finitely presented monoid which has solvable word problem but has no regular complete presentation
From MaRDI portal
Publication:673144
DOI10.1016/0304-3975(94)00264-JzbMATH Open0873.68105OpenAlexW1975351486MaRDI QIDQ673144FDOQ673144
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Word problems and a homological finiteness condition for monoids
- A finite Thue system with decidable word problem and without equivalent finite canonical system
- The Knuth-Bendix Completion Procedure and Thue Systems
- Über die Gelfand-Kirillov-Dimension. (On the Gelfand-Kirillov-dimension)
- Title not available (Why is that?)
- Presentations of groups and monoids
- Title not available (Why is that?)
- Infinite regular Thue systems
- Systems of reductions
- Title not available (Why is that?)
- Growth functions for some one-relator monoids
Cited In (5)
- The monoids of the patience sorting algorithm
- Constructing finitely presented monoids which have no finite complete presentation
- Gröbner bases of associative algebras and the Hochschild cohomology
- Finitely presented monoids with linear Dehn function need not have regular cross-sections.
- Numerical upper bounds on growth of automaton groups
This page was built for publication: A finitely presented monoid which has solvable word problem but has no regular complete presentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673144)
