Pages that link to "Item:Q1089798"
From MaRDI portal
The following pages link to The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798):
Displaying 15 items.
- The Knuth-Bendix algorithm and the conjugacy problem in monoids. (Q633198) (← 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)
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619) (← links)
- Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
- A finiteness condition for rewriting systems (Q1331943) (← links)
- Decidability and independence of conjugacy problems in finitely presented monoids (Q1637219) (← links)
- The Andrews-Curtis conjecture, term rewriting and first-order proofs (Q1662269) (← links)
- Cyclic rewriting and conjugacy problems. (Q2874367) (← links)
- Repetition-freeness with cyclic relations and chain relations (Q2893308) (← links)
- Deciding conjugacy in sylvester monoids and other homogeneous monoids (Q2942806) (← links)
- Finite canonical rewriting systems for congruences generated by concurrency relations (Q3779772) (← links)
- (Q3811749) (← links)
- (Q4217941) (← links)
