Abstract
Solitons, are special moving waves with the remarcable characteristic that when colliding they come out of the collision without loosing their initial properties. Soliton Automata (SA) are a particular class of Cellular Automata which support solitons. In this work we present a survey of recent developments in the area of SA and some new results regarding algorithmic issues of sequential and parallel versions of the SA. We show that the parallel implementation of the SA in the CRCW model of computation is optimal.
Author supplied keywords
Cite
CITATION STYLE
Papatheodorou, T. S., & Tsantanis, N. B. (1989). Fast soliton automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 401 LNCS, pp. 41–47). Springer Verlag. https://doi.org/10.1007/3-540-51859-2_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
