# Discrete Baker Transformation and Cellular Automata

Source: [Discrete Baker Transformation and Cellular Automata](<https://www.sota2.com/research/paper/68fa4cdd1e209131ce9502d8>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T09:01:23.657Z

Authors: Valeriy K. Bulitko

Published: 2004-07-08T04:08:22.000Z

## Abstract

In this paper we propose a rule-independent description of applications of cellular automata rules for one-dimensional additive cellular automata on cylinders of finite sizes. This description is shown to be a useful tool for for answering questions about automata's state transition diagrams (STD). The approach is based on two transformations: one (called {\\sl Baker transformation}) acts on the $n$-dimensional Boolean cube $\\frak B^n$ and the other (called {\\sl index-baker transformation}) acts on the cyclic group of power $n$. The single diagram of Baker transformation in $\\frak B^n$ contains an important information about all automata on the cylinder of size $n$. Some of the results yielded by this approach can be viewed as a generalization and extension of certain results by O. Martin, A. Odlyzko, S. Wolfram. Additionally, our approach leads to a convenient language for formulating properties, such as possession of cycles with certain lengths and given diagram heights, of automaton rules.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/math/0407116>)

[PDF](<https://arxiv.org/pdf/math/0407116.pdf>)
