Luquan Pan

Suggest Changes
Learn More
The following problem is shown to be undecidable: Given a reduced finite Thue systemS over an alphabet Σ with |Σ| = 2, isS equivalent to a finite Church-Rosser system?
  • 1