✦ LIBER ✦

Symmetry groups of automata

✍ Scribed by Edgardo Ugalde; Jesús Urías

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 412 KB
Volume: 70
Category: Article
ISSN: 0167-2789
DOI: 10.1016/0167-2789(94)90064-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symmetry in self-correcting cellular aut

Symmetry in self-correcting cellular automata

✍ Nicholas Pippenger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 768 KB

We study a class of cellular automata that are capable of correcting finite configurations of errors within a finite amount of time. Subject to certain natural conditions, we determine the geometric symmetries such automata may possess. In three dimensions the answer is particularly simple: such an

Actions of symmetry groups

✍ Graciela Chichilnisky 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 487 KB

This paper studies maps which are invariant under the action of the symmetry group Sk. The problem originates in social choice theory: there are k individuals each with a space of preferences X, and a social choice map : X k ~ X which is anonymous i.e. invariant under the action of a group of symmet

Finite automata presentable abelian grou

Finite automata presentable abelian groups

✍ André Nies; Pavel Semukhin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 622 KB

9. Symmetry groups

✍ J. S. Kelly 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 301 KB

Symmetry Groups of Coloured Graphs

✍ Ulrike Baumann 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB

## Abstract A perfect colouring Φ of a simple undirected connected graph __G__ is an edge colouring such that each vertex is incident with exactly one edge of each colour. This paper concerns the problem of representing groups by graphs with perfect colourings. We define groups of graph automorphis

Symmetry groups of chemical graphs

✍ K. Balasubramanian 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB

## Abstract The symmetry groups of all trees are shown to be expressible as generalized wreath products by a tree pruning algorithm. The symmetry groups of certain cyclic graphs which can be expresssed as generalized compositions are also shown to be generalized wreath products. The symmetry groups