✦ LIBER ✦

On Complexity of the Word Problem for Finitely Presented Commutative Semigroups

✍ Scribed by V. Yu. Popov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of the word problem for commu

✍ Dung T. Huynh 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

On the word problem for finitely-generat

✍ A. E. Ustyan 📂 Article 📅 1972 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 683 KB

Presentations for subsemigroups of finit

✍ J. C. Rosales; P. A. García-Sánchez 📂 Article 📅 1999 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 638 KB

Using string-rewriting for solving the w

✍ Klaus Madlener; Friedrich Otto 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 285 KB

On the membership problem for pseudovari

✍ Jorge Almeida 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 243 KB

Complexity of the identity checking prob

✍ J. Almeida; M. V. Volkov; S. V. Goldberg 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 230 KB