The set of reversible 90150 cellular automata is regular
β Scribed by Palash Sarkar; Rana Barua
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 869 KB
- Volume
- 84
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
β¦ Synopsis
The reversibility problem for 90/150 cellular automata (both null and periodic boundary) is tackled using continua& and regular expressions. A 90/150 cellular automata can be uniquely encoded by a string over the alphabet (0, 1). It is shown that the set of strings which correspond to reversible 90/l 50 cellular automata is a regular set. We use the regular expression to enumerate the number of reversible strings of a fixed length. As a consequence, it is shown that given a polynomial p(x), it is not always possible to get a 90/150 cellular automata whose transition matrix has characteristic polynomial p(x).
π SIMILAR VOLUMES
While cellular automata (CA) are increasingly used for modeling urban growth and land-use changes, the methods for identifying the dominant factors that drive the landscape dynamics when calibrating the model still require improvement, specifically in the context where a large number of factors are
Nondeterministic exponential time complexity bounds are established for recognizing true propositional formulas with partially ordered quantiΓΏers on propositional variables.