✦ LIBER ✦

Formal synthesis of an automaton by microprogram. II

✍ Scribed by A. T. Mishchenko

Publisher: Springer US
Year: 1968
Tongue: English
Weight: 650 KB
Volume: 4
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01077167

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The formal synthesis of an automaton by

The formal synthesis of an automaton by a microprogram. I

✍ A. T. Mishchenko 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 645 KB

Synthesis of an automaton by a set of mi

Synthesis of an automaton by a set of microprograms

✍ A. N. Chebotarev 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 629 KB

Abstract synthesis of a control automato

Abstract synthesis of a control automaton from its microprogram

✍ A. N. Chebotarev 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 502 KB

On formal synthesis of a grouped automat

On formal synthesis of a grouped automaton

✍ A. T. Mishchenko 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 386 KB

On the formalization of the concept of a

On the formalization of the concept of an experiment with an automaton

✍ M. A. Spivak 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 402 KB

Iteration of maps by an automaton

✍ F.M. Dekking 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Let x=(x1, x2,. .) with the xi elements of a finite set A be an automatic sequence, i.e., x is generated by a tag machine with deletion number one. Let F be a finite set and suppose maps rp,: F+F are given for all aEA. It is shown constructively that the sequence of iterates (cp,,, cpx,ocpxl, cpx,"c