Language Recognizable in Real Time by Cellular Automata
Véronique Terrier, C Laia · Complex Systems · 1994
We consider t he language L of t he st rings over t he alpha bet {a, I} of sha pe x lxl wher e Ixl is t he length of the st ring x . We show that L is r ecognized in real t ime by an it erat ive array but not by a one-way cellular a uto maton , while t he lan gu age {O, 1}*· L is rec ognized in real t im e by a cellula r automato n but not by an it er at ive array.