Pages that link to "Item:Q1075439"
From MaRDI portal
The following pages link to On deciding whether a monoid is a free monoid or is a group (Q1075439):
Displaying 14 items.
- Using string-rewriting for solving the word problem for finitely presented groups (Q580494) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- On two problems related to cancellativity (Q1070349) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group (Q1123272) (← links)
- It is undecidable whether a finite special string-rewriting system presents a group (Q1184861) (← links)
- When is an extension of a specification consistent? Decidable and undecidable cases (Q1186708) (← links)
- Contributions of Ronald V. Book to the theory of string-rewriting systems (Q1274982) (← links)
- Computing presentations for subgroups of polycyclic groups and of context-free groups (Q1328439) (← links)
- ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (Q3069735) (← links)
- New results on the prefix membership problem for one-relator groups (Q3388502) (← links)
- Commutativity in groups presented by finite Church-Rosser Thue systems (Q3794395) (← links)
