✦ LIBER ✦

A criterion for the decidability of theA-completeness problem for definite automata

✍ Scribed by D. N. Zhuk

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the classification of bases inPkaccor

✍ D. N. Babin 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 187 KB

Decidability of the termination problem

✍ Alain Finkel 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 854 KB

Decidability of the equivalence problem

✍ S. K. Shukuryan 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 500 KB

A generalized Stieltjes criterion for th

✍ Yu. M. Dyukarev 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 690 KB

On the decidability of the word problem

✍ M. Mazzucchelli; A. Cherubini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 506 KB

A criterion for completeness of the set

✍ A.G. Ramm 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 328 KB