✦ LIBER ✦

On the classification of bases inPkaccording to the decidability of the completeness problem for automata

✍ Scribed by D. N. Babin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the decidability of the word problem

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

Decidability of the termination problem

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

On decidability of the decomposability p

✍ Andrey S. Morozov; Denis K. Ponomaryov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 181 KB

Decidability of the equivalence problem

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

On the decidability of the equivalence p

✍ Stefano Varricchio 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 481 KB

On some algorithms for the solution of t

✍ V.N. Kublanovskaya 📂 Article 📅 1962 🏛 Elsevier Science ⚖ 955 KB