Alexander P. Buslaev
ABSTRACT
In the work a synthetic approach to traditional informatics frameworks is developed. In space of cellular automata we develop some analogies of classification in the classical theory of functions, Sobolev classes and Kolmogorov widths. An interpretation of classical cellular automata (CA) of Wolfram has been obtained in the form of flows on graph (closed and open chains). A characteristic of flows on graph - the spectrum - introduced in the works of Kozlov, Buslaev, Tatashev has been investigated. In the theory of functions in the mid-20th century, theorems on connection between the widths of Sobolev classes and spectra of corresponding differential equations have been obtained by Kolmogorov and Tikhomirov. Exact results for analogic problems for cellular automata have been obtained, software for dynamical system states simulation has been developed and future works are discussed.
- Wolfram S. 1983. Statistical mechanics of cellular automata. Reviews of Modern Physics, 55, 601--644.Google Scholar
Cross Ref
- Wolfram S. 1986. Tables of Cellular Automaton Properties. In book "Theory and Applications of Cellular Automata". World Scientific Publishing Co. Ltd. 485--557.Google Scholar
- Kolmogoroff A. 1936. Uber Die Beste Annaherung Von Funktionen Einer Gegebenen Funktionenklasse. Annals of Mathematics. 37, 1, 107--110.Google ScholarCross Ref
- Tikhomirov V. M. 1960. Widths of sets in functional spaces and the theory of best approximation. Uspekhi Math. Nauk. 15, 3, 81--120.Google Scholar
- Tikhomirov V. M. 1976. Some Problems in the Theory of Approximation. Moscow University. 304 p.Google Scholar
- Belitzky V., Ferrary P.A. 2005. Invariant measures and convergence properties for cellular automation 184 and related processes. Journal of Statistical Physics. 118, 3, 589--623.Google ScholarCross Ref
- Gray L., Griffeath D. 2001. The ergodic theory of traffic jams. Journal of Statistical Physics. 105, 3/4, 413--452.Google ScholarCross Ref
- Blank M.L. 2000. Exact analysis of dynamical systems arising in models of traffic flow. Russian Mathematical Surveys. 55, 3, 562--563.Google ScholarCross Ref
- Blank M. 2010. Properties of discrete time exclusion type procrsses in continuum. Journal of Statistical Physics. 140, 1, 170--197.Google ScholarCross Ref
- Kozlov V.V., Buslaev A.P., Tatashev A.G. 2015. Monotonic walks on a necklace and colored dynamic vector. International Journal of Computer Mathematics. 92, 9, 1910-1920. Google ScholarDigital Library
- Buslaev A.P., Tatashev A.G. 2016. Bernoulli algebra on common fractions and general oscillations. Journal of Mathematics Research. 8, 3, 82--93.Google ScholarCross Ref
- Buslaev A.P., Tatashev A.G., Yashina M.V. 2018. Flows Spectrum on Closed Trio of Contours. European Journal of Pure and Applied Mathematics. 11, 1, 260--283.Google ScholarCross Ref
- Buslaev A.P., Tatashev A.G., Yashina M.V. 2018. On Cellular Automata, Traffic and Dynamical Systems in Graphs. International Journal of Engineering & Technology. 7, 2.28, 351--356.Google Scholar
Index Terms
- On Spectra of Wolfram Cellular Automata in Hamming Spaces
Recommendations
Descriptional complexity of cellular automata and decidability questions
Third international workshop on descriptional complexity of automata, grammars and related structuresWe study the descriptional complexity of cellular automata (CA) which are a parallel model of computation. We show that between one of the simplest cellular models, the realtime one-way CA (realtime-OCA), and "classical" models like deterministic finite ...
Closure properties of cellular automata
Concerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have proved that real time cellular automata (CA) and linear time CA are equivalent if and only if real time CA is closed under reverse. In this paper we investigate ...
Cellular Automata: Elementary Cellular Automata
Cellular automata CA are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is ...
Comments