Algorithms and reductions for rewriting problems
Lecture notes in computer science1998pp. 166–180
Related Papers
- → Decidability of confluence and termination of monadic term rewriting systems(1991)7 cited
- → SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS(2014)1 cited
- → Decision problems in ordered rewriting(2002)22 cited
- → New undecidability results for finitely presented monoids(1997)9 cited
- → Some Decision Questions Concerning the Time Complexity of Language Acceptors(2013)