کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1898954 | 1044810 | 2007 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Algorithms for computing preimages of cellular automata configurations
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Algorithms for computing preimages of cellular automata configurations Algorithms for computing preimages of cellular automata configurations](/preview/png/1898954.png)
چکیده انگلیسی
This paper investigates pre-images (ancestors or past configurations) of specified configurations of one-dimensional cellular automata. Both counting and listing of pre-images are discussed. The main graphical tools used are the de Bruijn diagram, and its extension the pre-image network, which is created by concatenating de Bruijn diagrams. The counting of pre-images is performed as the multiplication of topological matrices of de Bruijn diagrams. Listing of pre-images is described using two algorithms. The first algorithm traces paths in the pre-image network and focuses on local knowledge of the network. The second performs a complete analysis of the network before proceeding with listing.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica D: Nonlinear Phenomena - Volume 233, Issue 2, 15 September 2007, Pages 95–111
Journal: Physica D: Nonlinear Phenomena - Volume 233, Issue 2, 15 September 2007, Pages 95–111
نویسندگان
Iztok Jeras, Andrej Dobnikar,