✦ LIBER ✦

[Lecture Notes in Computer Science] Applied Algebra, Algebraic Algorithms and Error-Correcting Codes Volume 539 || Some undecidability results for weakly confluent monadic string-rewriting systems

✍ Scribed by Mattson, Harold F.; Mora, Teo; Rao, T. R. N.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Appl

✍ Mattson, Harold F.; Mora, Teo; Rao, T. R. N. 📂 Article 📅 1991 🏛 Springer Berlin Heidelberg ⚖ 523 KB

[Lecture Notes in Computer Science] Appl

✍ Mattson, Harold F.; Mora, Teo; Rao, T. R. N. 📂 Article 📅 1991 🏛 Springer Berlin Heidelberg ⚖ 499 KB

[Lecture Notes in Computer Science] Appl

✍ Mattson, Harold F.; Mora, Teo; Rao, T. R. N. 📂 Article 📅 1991 🏛 Springer Berlin Heidelberg ⚖ 819 KB

[Lecture Notes in Computer Science] Appl

✍ Mora, Teo 📂 Article 📅 1989 🏛 Springer Berlin Heidelberg ⚖ 821 KB

[Lecture Notes in Computer Science] Appl

✍ Mora, Teo; Mattson, Harold 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg ⚖ 695 KB

[Lecture Notes in Computer Science] Appl

✍ Cohen, Gérard; Mora, Teo; Moreno, Oscar 📂 Article 📅 1993 🏛 Springer Berlin Heidelberg ⚖ 794 KB