Linear Speed-Up for Cellular Automata Synchronizers and Applications

Abstract

Simple cellular automata can be used as language recognizers or function calculators. There exist several proofs of the linear speed-up theorem in strong form for rccognizers [7,6, 1 l] but not for calculators. In this paper we design a linear speed-up method for a special kind of calculators, namely the synchronizers, which are diKcrent from recognizers… (More)
DOI: 10.1016/S0304-3975(96)00211-3

Topics

  • Presentations referencing similar topics