✦ LIBER ✦

[Lecture Notes in Computer Science] Rewriting Techniques and Applications Volume 1232 || New undecidability results for finitely presented monoids

✍ Scribed by Comon, Hubert

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Rewr

✍ Lescanne, Pierre 📂 Article 📅 1987 🏛 Springer Berlin Heidelberg ⚖ 588 KB

[Lecture Notes in Computer Science] Rewr

✍ Nipkow, Tobias 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 816 KB

[Lecture Notes in Computer Science] Rewr

✍ Comon, Hubert 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg ⚖ 963 KB

[Lecture Notes in Computer Science] Rewr

✍ Jouannaud, Jean-Pierre 📂 Article 📅 1985 🏛 Springer Berlin Heidelberg ⚖ 742 KB

[Lecture Notes in Computer Science] Rewr

✍ Lescanne, Pierre 📂 Article 📅 1987 🏛 Springer Berlin Heidelberg ⚖ 689 KB

[Lecture Notes in Computer Science] Rewr

✍ Book, Ronald V. 📂 Article 📅 1991 🏛 Springer Berlin Heidelberg ⚖ 818 KB