Pages that link to "Item:Q2247995"
From MaRDI portal
The following pages link to Word problem for deterministic and reversible semi-Thue systems (Q2247995):
Displaying 10 items.
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- On the \(n\)-permutation Post correspondence problem (Q496055) (← 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 undecidability of self-embedding for finite semi-Thue and Thue systems (Q1092041) (← links)
- The Thue problem and logical specifications of derivation in formal systems (Q1582908) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- On a method for proving exact bounds on derivational complexity in Thue systems (Q1938620) (← links)
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993) (← links)
- Small Semi-Thue System Universal with Respect to the Termination Problem (Q4601128) (← links)