✦ LIBER ✦

Subclasses of Turing machines reducible to finite automata

✍ Scribed by Yu. Ya. Breitbart; V. A. Kozmidiadi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparing Verboseness for Finite Automat

✍ Till Tantau 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 240 KB

A relationship between Turing machines a

✍ Makoto Sakamoto; Satoshi Okatani; Masatsugu Fukuda; Takao Ito; Hiroshi Furutani; 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 286 KB

Optimal simulation of two-dimensional al

✍ Akira Ito; Katsushi Inoue; Itsuo Takanami; Yue Wang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 633 KB

On a class of timer hybrid systems reduc

✍ Kemal Inan 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 758 KB

A relationship between two-dimensional f

✍ Katsushi Inoue; Itsuo Takanami; Hiroshi Taniguchi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 583 KB

The network complexity and the Turing ma

✍ C. P. Schnorr 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 745 KB