Pages that link to "Item:Q3816049"
From MaRDI portal
The following pages link to A decidable word problem without equivalent canonical term rewriting system (Q3816049):
Displaying 8 items.
- Solving the Caesar problem without categorical sortals (Q735346) (← links)
- Weak associativity and restricted rotation (Q987810) (← links)
- Almost all one-rule Thue systems have decidable word problems (Q1057265) (← links)
- A finite Thue system with decidable word problem and without equivalent finite canonical system (Q1073016) (← links)
- The word problem for Smullyan's lark combinator is decidable (Q1114668) (← links)
- Rational languages defined with a non-associative concatenation (Q1575941) (← links)
- On ground word problem of term equation systems (Q2803061) (← links)
- (Q5076252) (← links)