The following pages link to n-level rewriting systems (Q1084855):
Displaying 7 items.
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Constructing finitely presented monoids which have no finite complete presentation (Q1357103) (← links)
- (Q3779778) (← links)
- (Q3787463) (← links)
- Open problems in rewriting (Q5055780) (← links)