Back to Search
Start Over
Automata on the plane vs particles and collisions
- Source :
-
Theoretical Computer Science . Jun2009, Vol. 410 Issue 27-29, p2767-2773. 7p. - Publication Year :
- 2009
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 410
- Issue :
- 27-29
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 39784618
- Full Text :
- https://doi.org/10.1016/j.tcs.2009.03.039