Pages that link to "Item:Q1107523"
From MaRDI portal
The following pages link to Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule (Q1107523):
Displaying 11 items.
- A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems (Q844899) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- On the Knuth-Bendix completion for concurrent processes (Q1262753) (← links)
- On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
- Confluence problems for trace rewriting systems (Q1854457) (← links)
- WORD EQUATIONS OVER GRAPH PRODUCTS (Q3521473) (← links)
- On confluence of one-rule trace-rewriting systems (Q4841768) (← links)
- On confluence versus strong confluence for one-rule trace-rewriting systems (Q4841769) (← links)
- Word problems over traces which are solvable in linear time (Q5096152) (← links)
- One-rule trace-rewriting systems and confluence (Q5096864) (← links)
- LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE (Q5483463) (← links)
