Pages that link to "Item:Q1057264"
From MaRDI portal
The following pages link to Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264):
Displaying 19 items.
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- A strong geometric hyperbolicity property for directed graphs and monoids. (Q743919) (← links)
- Some decision problems about controlled rewriting systems (Q910246) (← 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)
- On deciding whether a monoid is a free monoid or is a group (Q1075439) (← links)
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← links)
- The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
- An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group (Q1123272) (← links)
- When is an extension of a specification consistent? Decidable and undecidable cases (Q1186708) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- Codes modulo finite monadic string-rewriting systems (Q1341747) (← links)
- Weights for total division orderings on strings (Q1346630) (← links)
- Cancellation rules and extended word problems (Q2266586) (← links)
- Lambda-confluence for context rewriting systems (Q2344748) (← links)
- Commutativity in groups presented by finite Church-Rosser Thue systems (Q3794395) (← links)
- Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)
