A specialized completion procedure for monadic string-rewriting systems presenting groups
From MaRDI portal
Recommendations
- Completing a finite special string-rewriting system on the congruence class of the empty word
- scientific article; zbMATH DE number 1740168
- On weakly confluent monadic string-rewriting systems
- On groups presented by monadic rewriting systems with generators of finite order.
- Monoid presentations of groups by finite special string-rewriting systems
Cited in
(15)- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- Completing a finite special string-rewriting system on the congruence class of the empty word
- Computing presentations for subgroups of polycyclic groups and of context-free groups
- A completion procedure for finitely presented groups that is based on word cycles
- scientific article; zbMATH DE number 4036065 (Why is no real title available?)
- The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems
- Finding a finite group presentation using rewriting
- scientific article; zbMATH DE number 1740168 (Why is no real title available?)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- On groups presented by monadic rewriting systems with generators of finite order.
- Equational Theorem Proving for Clauses over Strings
- The Knuth-Bendix algorithm and the conjugacy problem in monoids.
- PATCH graphs: an efficient data structure for completion of finitely presented groups
- On weakly confluent monadic string-rewriting systems
- Equational theorem proving for clauses over strings
This page was built for publication: A specialized completion procedure for monadic string-rewriting systems presenting groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036570)
