Pages that link to "Item:Q912986"
From MaRDI portal
The following pages link to Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986):
Displaying 15 items.
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- Some decision problems about controlled rewriting systems (Q910246) (← links)
- On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
- On the descriptive power of special Thue systems (Q1126309) (← links)
- Completing a finite special string-rewriting system on the congruence class of the empty word (Q1191634) (← links)
- Some properties of finite special string-rewriting systems (Q1201349) (← links)
- On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
- Codes modulo finite monadic string-rewriting systems (Q1341747) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← links)
- On the word problem for special monoids (Q2163877) (← links)
- The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403) (← links)
- Infinite Families of Finite String Rewriting Systems and Their Confluence (Q4933319) (← links)
- Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)
- Applying rewriting methods to special monoids (Q5288344) (← links)
- COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS (Q5461660) (← links)
