کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
438047 690221 2009 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Automata on the plane vs particles and collisions
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Automata on the plane vs particles and collisions
چکیده انگلیسی

In this note, colorings of the plane by finite sequential machines are compared to previously introduced notions of ultimately periodic tilings of the plane. Finite automata with no counter characterize exactly biperiodic tilings. Finite automata with one counter characterize exactly particles — periodic colorings that are ultimately periodic in every direction. Finite automata with two counters and aperiodic colorings characterize exactly collisions — ultimately periodic tilings of the plane.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 410, Issues 27–29, 28 June 2009, Pages 2767-2773