Computability via Cellular Automata-Reference-Cited by-同舟云学术

Computability via Cellular Automata

Published:2017-12 Issue:5 Volume:44 Page:314-328
ISSN:0147-6882
Container-title:Scientific and Technical Information Processing
language:en
Short-container-title:Sci. Tech. Inf. Proc.

Author:

Gavrilov S. V.,Matyushkin I. V.,Stempkovsky A. L.

Publisher

Allerton Press

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.3103/S0147688217050057.pdf

Reference68 articles.

1. Al-Rabadi, A.N., Conservative reversible elementary cellular automata and their quantum computations, in Cellular Automata–Innovative Modelling for Science and Engineering. http://cdn.intechopen.com/pdfswm/15007.pdf.

2. Tumanov, V.E., Basics of Designing Relational Databases. http://www.intuit.ru/goods_store/ebooks/8322.

3. Gergel’, V.P. and Strongin, R.G., Osnovy parallel’nykh vychislenii dlya mnogoprotsessornykh vychislitel’nykh sistem. Uchebnoe posobie (Basics of Parallel Computing for Multiprocessor Computing Systems), Nizhnii Novgorod: Izd. NNGU im. N. I. Lobachevskogo, 2003.

4. Alekseev, V.E. and Talanov, V.A., Grafy. Modeli vychislenii. Struktury dannykh: Uchebnik (Graphs. Models of Calculations. Data Structures), Nizhnii Novgorod: Izd. NNGU, 2005.

5. Stefanova, T.S., Selection of the content of training for non-classical computing models, Izv. RGPU im. A. I. Gertsena, 2008, no. 58, pp. 440–451. http://cyberleninka. ru/article/n/otbor-soderzhaniya-obucheniya-neklassicheskim- vychislitelnym-modelyam. Cited April 15, 2015.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Review of Cellular Automata Algorithms for Placement and Routing Problems;2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus);2021-01-26

2. Automatic Texture Based Classification of the Dynamics of One-Dimensional Binary Cellular Automata;International Journal of Natural Computing Research;2019-10