Pages that link to "Item:Q1166924"
From MaRDI portal
The following pages link to When is a monoid a group? The Church-Rosser case is tractable (Q1166924):
Displaying 10 items.
- Decidable sentences of Church-Rosser congruences (Q593775) (← links)
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group (Q760506) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264) (← links)
- On deciding whether a monoid is a free monoid or is a group (Q1075439) (← 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)
- Contributions of Ronald V. Book to the theory of string-rewriting systems (Q1274982) (← links)
- Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems (Q3708211) (← links)
- Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems (Q3741791) (← links)
