✦ LIBER ✦

The problem of completeness in a class of Moore automata

✍ Scribed by M. A. Spivak

Publisher: Springer US
Year: 1972
Tongue: English
Weight: 158 KB
Volume: 4
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01073931

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The problem of completeness in the struc

The problem of completeness in the structural theory of probabilistic automata

✍ L. V. Makarevich 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 419 KB

Complete classes of automata for the α0-

Complete classes of automata for the α0-product

✍ Zoltán Ésik; Pál Dömösi 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 822 KB

On a Class of Matrix Completion Problems

✍ Vladimir K. Dubovoj; Bernd Fritzsche; Bernd Kirstein 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 618 KB

Completeness problems in classes of comp

Completeness problems in classes of computable named functions

✍ D. B. Bui; B. V. Gubskii; V. N. Red'ko 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 988 KB

A Random NP-complete problem for inversi

A Random NP-complete problem for inversion of 2D cellular automata

✍ Bruno Durand 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 966 KB

On a problem in the collective behavior

On a problem in the collective behavior of automata

✍ Paul M.B. Vitányi 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 344 KB

THE COLLECTIVE BEHAVIOR Varslltlvsky 14) irlucst;lg&d the function L : N -+ N informally defined by: L(H) is tllc m;1ximum length of a configku-ation whiol~ can be grow;.. frotn one ;Uivated automaton in a linear cel1 space of ider2tical finite s?We automata kkng IZ ir2tenr~l st;ltes, Each auton2ato