A finitely presented monoid which has solvable word problem but has no regular complete presentation
From MaRDI portal
(Redirected from Publication:673144)
Recommendations
Cites work
- scientific article; zbMATH DE number 4014693 (Why is no real title available?)
- scientific article; zbMATH DE number 3771642 (Why is no real title available?)
- scientific article; zbMATH DE number 66487 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- A finite Thue system with decidable word problem and without equivalent finite canonical system
- Growth functions for some one-relator monoids
- Infinite regular Thue systems
- Presentations of groups and monoids
- Systems of reductions
- The Knuth-Bendix Completion Procedure and Thue Systems
- Word problems and a homological finiteness condition for monoids
- Über die Gelfand-Kirillov-Dimension. (On the Gelfand-Kirillov-dimension)
Cited in
(5)- Constructing finitely presented monoids which have no finite complete presentation
- The monoids of the patience sorting algorithm
- Gröbner bases of associative algebras and the Hochschild cohomology
- Numerical upper bounds on growth of automaton groups
- Finitely presented monoids with linear Dehn function need not have regular cross-sections.
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)