๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Indecomposable local maps of tessellation automata

โœ Scribed by Masakazu Nasu

Publisher
Springer
Year
1979
Tongue
English
Weight
947 KB
Volume
13
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Open maps for tessellation automata
Open maps for tessellation automata
โœ Akira Maruoka ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 810 KB
Pattern reproduction in tessellation aut
Pattern reproduction in tessellation automata of arbitrary dimension
โœ Thomas J. Ostrand ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 179 KB

Amoroso and Cooper have shown that for an arbitrary state alphabet A, one-and two-dimensional tessellation automata are definable which have the ability to reproduce any finite pattern contained in the tessellation space. This note shows that the same construction may be applied to tessellation spac

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

Local indecomposability of certain geome
Local indecomposability of certain geometric graphs
โœ J.I. Hall ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 912 KB

A graph is indecomposable if its complement is connected. If a graph is locally indecomposable, then it is typically indecomposable itself. Here we study the converse. Under what circumstances does global indecomposability force local indecomposability? The results are applied to a certain class of