✦ LIBER ✦

Iterative behaviour of one-dimensional threshold automata

✍ Scribed by E. Goles; M. Tchuente

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 167 KB
Volume: 8
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90130-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognition of formal languages in one-d

Recognition of formal languages in one-dimensional iterative automata

✍ G. S. Plesnevich 📂 Article 📅 1979 🏛 Springer US 🌐 English ⚖ 781 KB

Some regular state sets in the system of

Some regular state sets in the system of one-dimensional iterative automata

✍ Youichi Kobuchi; Hidenosuke Nishio 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 950 KB

A numerical study of one-dimensional cel

A numerical study of one-dimensional cellular automata

✍ A. Sinha; C. Jayaprakash 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 964 KB

One photon double ionization of helium:

One photon double ionization of helium: threshold behaviour

✍ Pascal Lablanquie; Kenji Ito; Paul Morin; Irène Nenner; John H. D. Eland 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 335 KB

Characteristic parameters and classifica

Characteristic parameters and classification of one-dimensional cellular automata

✍ Yoshihiko Kayama; Masayoshi Tabuse; Haruhiko Nishimura; Tsutomu Horiguchi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 766 KB

Completeness problem of one-dimensional

Completeness problem of one-dimensional binary scope-3 tessellation automata

✍ Akira Maruoka; Masayuki Kimura 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 577 KB

In this report we deal with the question of whether or not, for a given tessellation automaton, there exists a finite state pattern of the array that can never be assumed by the array no matter what sequence of global transformations is applied to a certain canonical starting pattern. We are exclusi